On approximate string matching of unique oligonucleotides.
The current research considers the approximate string matching search for important subsequences from DNA sequences, which is essential for numerous bioinformatics computation tasks. We tested several approximate string matching algorithms and furthermore developed one for DNA data. Run times of the algorithms are important, since the amount of data is very large.
Hyyrö
H
H
Department of Computer and Information Sciences, 33014 University of Tampere, Finland. Heikki.Hyyro@uta.fi
Vihinen
M
M
Juhola
M
M
D000465:Algorithms; D004271:DNA, Fungal / Q000737:chemistry*; D030561:Databases, Nucleic Acid; D016681:Genome, Fungal; D015698:Genomic Library; D009841:Oligonucleotides; D010363:Pattern Recognition, Automated; D012441:Saccharomyces cerevisiae / Q000235:genetics; D016415:Sequence Alignment / Q000379:methods
D004271:DNA, Fungal; D009841:Oligonucleotides