A hardware algorithm for the exact subsequence matching problem in DNA strings

Romanian Journal of Information Science and Technology

Volumn 12, Issue 1, 2009, Pages 51-67

  Cret, Octavian ^a   Mathe, Zsolt ^b   Ciobanu, Paul ^a   Marginean, Sonia ^a   Darabant, Adrian ^c  

^a TECHNICAL UNIVERSITY OF CLUJ NAPOCA   (Romania)

^b INRIA   (France)

^c BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

Exon; FPGA; Intron; Systolic array; VHDL

Indexed keywords

EID: 79951740318     PISSN: 14538245     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Boeckman B. Et Al., The Swiss-Prot Protein Knowledgebase And Its Supplement Trembl In 2003, Nucleic Acids Research, 31, No. 1, 2003, Pp. 365-370.
2. Benson D. A., Karsch-Mizrachi I., Lipman D. J., Ostell J., Wheeler D. L., Genbank: Update, Nucleic Acids Research, Database Issue 32, 2004, D23-D26.
3. Stoesser G. Et Al., The Embl Nucleotide Sequence Database, Nucleic Acids Research, 30, 2002, Pp. 21-26. (Pubitemid 34679494)
4. Zhang M.Q., Computational Prediction Of Eukaryotic Protein-Coding Genes, Nature Rev. Genet., 3, 2002, Pp. 698-709. (Pubitemid 34984258)
5. Gokhale M. B., Graham P. S., Recon-Gurable Computing, Springer, 2005, P. 160.
6. Needleman S. B., Wunsch C. D., A General Method Applicable To The Search For Similarities In The Amino Acid Sequences Of Two Proteins, Journal Of Molecular Biology, 48, 1970, Pp. 443-453.
7. Smith T. F., Waterman M. S., Identi-Cation Of Common Molecular Subsequences, Journal Of Molecular Biology, 147, 1981, Pp. 195-197.
8. Pearson W. R., Lipman D. J., Improved Tools For Biological Sequence Comparison, Proc. Natl. Acad. Sci., 85, 1988, Pp. 3244-3248.
9. Altschul S. F., Gish W., Miller W., Myers W. E., Lipman D. J., Basic Local Alignment Search Tool, Journal Of Molecular Biology, 215, 1990, No. 3, Pp. 403-410.
10. Häohl M.,. Kurtz S, Ohlebusch E., E Cient Multiple Genome Alignment, Bioin-Formatics, 2002, 18:312S-320S.
11. Kaderali L., Schliep A., Selecting Signature Oligonucleotides To Identify Organisms Using Dna Arrays, Bioinformatics, 2002, 18:1340-1349. (Pubitemid 35244191)
12. Kurtz S., Schleiermacher C., Reputer: Fast Computation Of Maximal Repeats In Complete Genomes, Bioinformatics, 1999, 15:426-427. (Pubitemid 29312632)
13. Tsafrir D., Etsion Y., Feitelson D. G., Modeling User Runtime Estimates, In 11Th Job Scheduling Strategies For Parallel Processing (Jsspp), Pp. 1-35, Springer-Verlag, Jun 2005. Lncs 3834. (Pubitemid 43849377)