A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences.
Alireza AbdiMarko DjukanovicHesam Tahmasebi BoldajiHadis SalehiAleksandar KarteljPublished in: CoRR (2024)
Keyphrases
- experimental evaluation
- dynamic programming
- cost function
- learning algorithm
- worst case
- objective function
- long sequences
- search space
- sequence alignment
- computational cost
- detection algorithm
- sequence matching
- np hard
- computational complexity
- simulated annealing
- real world
- times faster
- input data
- linear programming
- high accuracy
- optimal solution
- search algorithm
- evolutionary algorithm
- preprocessing