TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes.
Ilya MinkinSon K. PhamPaul MedvedevPublished in: CoRR (2016)
Keyphrases
- graph structure
- optimal solution
- learning algorithm
- detection algorithm
- computationally efficient
- k means
- dynamic programming
- computational cost
- expectation maximization
- graph based algorithm
- computational complexity
- preprocessing
- cost function
- np hard
- depth first search
- minimum spanning tree
- graph partitioning
- undirected graph
- neural network
- solution path
- search algorithm
- objective function
- segmentation algorithm
- ant colony optimization
- matching algorithm
- bipartite graph
- random walk
- probabilistic model
- search space
- shortest path problem
- random graphs
- data structure
- graph search
- maximum flow
- image segmentation