Assembling sequences of DNA using an on-line algorithm based on DeBruijn graphs.
Juan Manuel Ciro RestrepoAndrés Felipe Zapata PalacioMauricio ToroPublished in: CoRR (2017)
Keyphrases
- learning algorithm
- computational cost
- dynamic programming
- detection algorithm
- segmentation algorithm
- worst case
- np hard
- k means
- significant improvement
- cost function
- search space
- optimal solution
- particle swarm optimization
- graph structure
- preprocessing
- computational complexity
- spanning tree
- optimization algorithm
- graph construction
- sequence matching
- tree structure
- expectation maximization
- probabilistic model
- objective function
- similarity measure