A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates.
Diego P. RubertPedro FeijãoMarília D. V. BragaJens StoyeFábio Viduani MartinezPublished in: WABI (2016)
Keyphrases
- np hard
- memory requirements
- computational cost
- learning algorithm
- space complexity
- worst case
- computational complexity
- optimal solution
- randomized algorithm
- distance metric
- objective function
- k means
- preprocessing
- dynamic programming
- detection algorithm
- distance function
- error bounds
- absolute error
- minimum distance
- comparative analysis
- tree structure
- feature selection