Algorithms for computing variants of the longest common subsequence problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4288 LNCS, Issue , 2006, Pages 399-408

  Rahman, M Sohel ^a,b   Iliopoulos, Costas S ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

DNA SEQUENCE ANALYSIS; EFFICIENT ALGORITHM; LONGEST COMMON SUBSEQUENCE PROBLEM; LONGEST COMMON SUBSEQUENCES;

ALGORITHMS; BIOCHEMISTRY; COMPUTATIONAL EFFICIENCY; MOLECULAR BIOLOGY;

COMPUTATION THEORY;

EID: 38849206672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_41     Document Type: Conference Paper

References (11)

1. ED'NIMBUS. http://igm.univ-mlv.fr/peterlon/officiel/ednimbus/.
2. S. F. Altschul, W. Gish, W. Miller, E. W. Meyers, and D. J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215(3):403-410, 1990.
3. M. A. Bender and M. Farach-Colton. The lea problem revisited. In Latin American Theoretical INformatics (LATIN), pages 88-94, 2000.
4. H. Gabow, J. Bentley, and R. Tarjan. Scaling and related techniques for geometry problems. In Symposium on the Theory of Computing (STOC), pages 135-143, 1984.
5. I. Lee, A. Apostolico, C. S. Iliopoulos, and K. Park. Finding approximate occurrence of a pattern that contains gaps. In Australasian Workshop on Combinatorial Algorithms (AWOCA), pages 89-100, 2003.
6. B. Ma and K. Zhang. On the longest common rigid subsequence problem. In CPM, pages 11-20, 2005.
7. W. Pearson and D. Lipman. Improved tools for biological sequence comparison. Proceedings of National Academy of Science, USA, 85:2444-2448, 1988.
8. P. Peterlongo. Private communication.
9. P. Peterlongo, N. Pisanti, F. Boyer, and M.-F. Sagot. Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array. In SPIRE, pages 179-190, 2005.
10. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80-82, 1977.
11. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.