The parameterized complexity of sequence alignment and consensus

This publication has 12 references indexed in Scilit:

• The computation of consensus patterns in DNA sequences
  Mathematical and Computer Modelling, 1993
• Discovering Consensus Molecular Sequences
  Published by Springer Nature ,1993
• Efficient methods for multiple sequence alignment with guaranteed error bounds
  Bulletin of Mathematical Biology, 1993
• Parameterized learning complexity
  Published by Association for Computing Machinery (ACM) ,1993
• Multiple Alignment, Communication Cost, and Graph Matching
  SIAM Journal on Applied Mathematics, 1992
• [27] Dynamic programming algorithms for biological sequence comparison
  Published by Elsevier ,1992
• Searching subsequences
  Theoretical Computer Science, 1991
• A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
  IEEE Transactions on Systems, Man, and Cybernetics, 1978
• The Complexity of Some Problems on Subsequences and Supersequences
  Journal of the ACM, 1978
• Matching Sequences under Deletion/Insertion Constraints
  Proceedings of the National Academy of Sciences, 1972