A linear-time algorithm for finding a maximum-length ORF in a splice graph.
Jerzy W. JaromczykNeil MooreChristopher L. SchardlPublished in: Int. J. Comput. Biol. Drug Des. (2012)
Keyphrases
- maximum number
- graph theory
- graph structure
- graph representation
- structured data
- graph model
- random walk
- directed graph
- graph theoretic
- planar graphs
- connected components
- energy dissipation
- strongly connected
- random graphs
- total length
- steiner tree
- data sets
- graph partitioning
- spanning tree
- bipartite graph
- feature space
- data structure
- clustering algorithm
- data mining