Computational complexity of multiple sequence alignment with SP-score

Journal of Computational Biology

Volumn 8, Issue 6, 2001, Pages 615-623

  Just, Winfried ^a  

^a OHIO UNIVERSITY   (United States)

Author keywords

MAX SNP hardness; NP hardness; Polynomial time approximation scheme; Scoring matrix; Sequence alignment

Indexed keywords

ALGORITHM; ARTICLE; GENETIC PROCEDURES; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; MATHEMATICAL PARAMETERS; PRIORITY JOURNAL; SCORING SYSTEM;

ALGORITHMS; COMPUTATIONAL BIOLOGY; MODELS, STATISTICAL; SEQUENCE ALIGNMENT;

EID: 0035680964     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652701753307511     Document Type: Article

References (18)

1. Hardness of approximations
2. Proof verification and intractability of approximation problems
3. Empirical and structural models for insertions and deletions in the divergent evolution of proteins
4. The complexity of multiple alignment with SP-score that is a metric
5. The multiple sequence alignment problem in biology
6. A model of evolutionary change in proteins
7. An introduction to biological sequence analysis
8. Letter to the editor: Commentary on the letter by Ward C. Wheeler
9. Amino acid substitution matrices from protein blocks
10. Some open problems in computational molecular biology
11. Optimization, approximation and complexity classes
12. Analysis of insertions/deletions in protein structures
13. On the complexity of multiple sequence alignment
14. Letter to the editor: The triangle inequality and character analysis