A new bucket-based algorithm for finding LCS from two given molecular sequences


Conference Paper

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. © 2006 IEEE.

Full Text

Duke Authors

Cited Authors

  • Rizvi, SAM; Agarwal, P

Published Date

  • November 14, 2006

Published In

  • Proceedings Third International Conference Oninformation Technology: New Generations, Itng 2006

Volume / Issue

  • 2006 /

Start / End Page

  • 560 - 561

International Standard Book Number 10 (ISBN-10)

  • 0769524974

International Standard Book Number 13 (ISBN-13)

  • 9780769524979

Digital Object Identifier (DOI)

  • 10.1109/ITNG.2006.12

Citation Source

  • Scopus