An Exhaustive Genome Assembly Algorithm Using K-Mers to Indirectly Perform N-Squared Comparisons in O(N).
Maulik K. ShahHoJoon LeeStephanie A. RogersJeffrey W. TouchmanPublished in: CSB (2004)
Keyphrases
- detection algorithm
- learning algorithm
- computational complexity
- optimal solution
- preprocessing
- experimental evaluation
- improved algorithm
- selection algorithm
- expectation maximization
- input data
- computational cost
- similarity measure
- np hard
- times faster
- high accuracy
- simulated annealing
- tree structure
- theoretical analysis
- optimization algorithm
- objective function
- genetic algorithm
- convex hull
- classification algorithm
- euclidean distance
- ant colony optimization
- data structure
- search space
- worst case
- probabilistic model
- multi objective
- cost function
- dynamic programming