论文信息 - A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences

A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences

This paper presents a new algorithm for finding longest common subsequence from two given sequences of DNA, proteins etc. of interest. Given algorithm is quite effective as far as time complexity is concerned. Our method compares the given database sequence of DNA representing the entire/partial genetic structure of some organism (such sequences are very long), which is assumed to be stored in the database only once with a given query sequence

Pankaj Agarwal | S. A. M. Rizvi

[1] S. Salzberg,et al. Fast algorithms for large-scale genome alignment and comparison. , 2002, Nucleic acids research.

[2] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[3] Claus Rick,et al. New Algorithms for the Longest Common Subsequence Problem , 1994 .

[4] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[5] Junior Barrera,et al. A parallel algorithm for enumerating combinations , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

[6] M. W. Du,et al. Computing a longest common subsequence for a set of strings , 1984, BIT.

[7] Srinivas Aluru,et al. Parallel biological sequence comparison using prefix computations , 2003, J. Parallel Distributed Comput..

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

[9] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.