Near-Optimal Block Alignments

The optimal alignment of two given biosequences is mathematically optimal, but it may not be a biologically optimal one. To investigate more possible alignments with biological meaning, one can relax the scoring functions to get near-optimal alignments. Though the near optimal alignments increase the possibility of finding the correct alignment, they may confuse the biologists because the size of candidates is large. In this paper, we present the filter scheme for the near-optimal alignments. An easy method for tracing the near-optimal alignments and an algorithm for filtering those alignments are proposed. The time complexity of our algorithm is O(dmn) in the worst case, where d is the maximum distance between the near-optimal alignments and the optimal alignment, and m and n are the lengths of the input sequences, respectively.

[1]  M. O. Dayhoff,et al.  Atlas of protein sequence and structure , 1965 .

[2]  E. Myers,et al.  Basic local alignment search tool. , 1990, Journal of molecular biology.

[3]  L. Bergroth,et al.  A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[4]  L. Guarente,et al.  Molecular Biology of Aging , 1999, Cell.

[5]  S. Colowick,et al.  Methods in Enzymology , Vol , 1966 .

[6]  Alberto Apostolico,et al.  The longest common subsequence problem revisited , 1987, Algorithmica.

[7]  O. Gotoh.  An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.

[8]  Dalit Naor,et al.  On Near-Optimal Alignments of Biological Sequences , 1994, J. Comput. Biol..

[9]  Thomas G. Szymanski,et al.  A fast algorithm for computing longest common subsequences , 1977, CACM.

[10]  O. Gotoh,et al.  Optimal sequence alignment allowing for long gaps , 1990 .

[11]  S. Altschul,et al.  Optimal sequence alignment using affine gap costs. , 1986, Bulletin of mathematical biology.

[12]  Richard C. T. Lee,et al.  Systolic algorithms for the longest common subsequence problem , 1987 .

[13]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[14]  Chang-Biau Yang,et al.  The Better Alignment Among Output Alignments , 2007, METMBS.

[15]  W R Pearson,et al.  Dynamic programming algorithms for biological sequence comparison. , 1992, Methods in enzymology.

[16]  R. Doolittle,et al.  Aligning amino acid sequences: Comparison of commonly used methods , 1985, Journal of Molecular Evolution.

[17]  Chang-Biau Yang,et al.  Prediction of Protein Structures Based on Curve Alignment , 2022 .