Constrained sequence alignment: A general model and the hardness results
From MaRDI portal
Publication:2462385
DOI10.1016/j.dam.2007.06.016zbMath1123.92008MaRDI QIDQ2462385
Chin Lung Lu, Chuan Yi Tang, Yun-Sheng Chung
Publication date: 30 November 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.06.016
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The NPO-completeness of the longest Hamiltonian cycle problem
- Efficient methods for multiple sequence alignment with guaranteed error bounds
- Approximation algorithms for multiple sequence alignment
- Proof verification and the hardness of approximation problems
- Efficient Algorithms for Regular Expression Constrained Sequence Alignment
- Combinatorial Pattern Matching
- The complexity of multiple sequence alignment with SP-score that is a metric