An O(n3) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges.
Shuzhi YuFanchang HaoHon Wai LeongPublished in: J. Bioinform. Comput. Biol. (2016)
Keyphrases
- learning algorithm
- times faster
- cost function
- objective function
- computational complexity
- preprocessing
- np hard
- dynamic programming
- computational cost
- detection algorithm
- optimization algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- expectation maximization
- input data
- worst case
- probabilistic model
- k means
- data sets
- ant colony optimization
- matching algorithm
- recognition algorithm
- selection algorithm
- sequence data
- finite state vector quantization