TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes.
Ilya MinkinSon K. PhamPaul MedvedevPublished in: Bioinform. (2017)
Keyphrases
- graph structure
- graph based algorithm
- cost function
- simulated annealing
- np hard
- detection algorithm
- search space
- k means
- dynamic programming
- graph model
- particle swarm optimization
- computationally efficient
- undirected graph
- matching algorithm
- segmentation algorithm
- computational cost
- tree structure
- objective function
- np complete
- worst case
- shortest path problem
- random graphs
- depth first search
- search algorithm