Sciweavers

866 search results - page 106 / 174
» Bidirectionalizing graph transformations
Sort
View
AGTIVE
2003
Springer
15 years 3 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
BMCBI
2004
121views more  BMCBI 2004»
14 years 9 months ago
DEDB: a database of Drosophila melanogaster exons in splicing graph form
Background: A wealth of quality genomic and mRNA/EST sequences in recent years has provided the data required for large-scale genome-wide analysis of alternative splicing. We have...
Bernett T. K. Lee, Tin Wee Tan, Shoba Ranganathan
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
14 years 11 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
15 years 10 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han