Approximating Shortest Superstring Problem Using de Bruijn Graphs.
Alexander GolovnevAlexander S. KulikovIvan MihajlinPublished in: CPM (2013)
Keyphrases
- graph structure
- graph structures
- directed graph
- shortest path
- graph mining
- real time
- graph representation
- graph databases
- graph matching
- graphical models
- data structure
- image segmentation
- knowledge base
- social networks
- learning algorithm
- data sets
- graph theoretic
- small world
- path length
- graph clustering
- motif discovery
- database
- adjacency matrix