Sciweavers

5606 search results - page 556 / 1122
» Randomization Techniques for Graphs.
Sort
View
ISMB
2003
15 years 8 months ago
Deriving phylogenetic trees from the similarity analysis of metabolic pathways
Comparative analysis of metabolic pathways in different genomes can give insights into the understanding of evolutionary and organizational relationships among species. This type ...
Maureen Heymans, Ambuj K. Singh
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 7 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
BMCBI
2006
141views more  BMCBI 2006»
15 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
ENTCS
2007
103views more  ENTCS 2007»
15 years 7 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
PAMI
2006
156views more  PAMI 2006»
15 years 7 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann