loading...
A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences
Las Vegas, Nevada April 10-April 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITNG.2006.12Third International Conference on Inf ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Dr. S.A.M. Rizvi, Pankaj Agarwal, "A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences," Information Technology: New Generations, Third International Conference on, pp. 560-561, Third International Conference on Information Technology: New Generations (ITNG'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ITNG.2006.12,
author = {Dr. S.A.M. Rizvi and Pankaj Agarwal},
title = {A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences},
journal ={Information Technology: New Generations, Third International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2497-4},
pages = {560-561},
doi = {http://doi.ieeecomputersociety.org/10.1109/ITNG.2006.12},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Technology: New Generations, Third International Conference on
TI - A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences
SN - 0-7695-2497-4
SP560
EP561
A1 - Dr. S.A.M. Rizvi,
A1 - Pankaj Agarwal,
PY - 2006
KW - null
VL - 0
JA - Information Technology: New Generations, Third International Conference on
ER -
 
Dr. S.A.M. Rizvi, Jamia Millia Islamia University, India
Pankaj Agarwal, Jamia Millia Islamia University, India
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.
Citation:
Dr. S.A.M. Rizvi, Pankaj Agarwal, "A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences," itng, pp.560-561, Third International Conference on Information Technology: New Generations (ITNG'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.