Time and Memory Efficient Algorithm for Extracting Palindromic and Repetitive Subsequences in Nucleic Acid Sequences.
Tatsuhiko TsunodaMasao FukagawaToshihisa TakagiPublished in: Pacific Symposium on Biocomputing (1999)
Keyphrases
- memory efficient
- objective function
- multiple sequence alignment
- external memory
- detection algorithm
- learning algorithm
- iterative deepening
- preprocessing
- k means
- significant improvement
- computational cost
- expectation maximization
- segmentation algorithm
- memory space
- simulated annealing
- hidden markov models
- cost function
- genetic algorithm
- tree structure
- matching algorithm
- convergence rate
- frequent itemset mining
- np hard
- depth first search
- computational complexity
- data structure
- pattern growth
- long sequences
- longest common subsequence