Abstract
DNA sequence classification is the activity of determining whether or not an unlabeled sequence S belongs to an existing class C. This paper proposes two new techniques for DNA sequence classification. The first technique works by comparing the unlabeled sequence S with a group of active motifs discovered from the elements of C and by distinction with elements outside of C. The second technique generates and matches gapped fingerprints of S with elements of C. Experimental results obtained by running these algorithms on long and well conserved Alu sequences demonstrate the good performance of the presented methods compared with FASTA. When applied to less conserved and relatively short functional sites such as splice- junctions, a variation of the second technique combining fingerprinting with consensus sequence analysis gives better results than the current classifiers employing text compression and machine learning algorithms.
Original language | English (US) |
---|---|
Pages (from-to) | 209-218 |
Number of pages | 10 |
Journal | Journal of Computational Biology |
Volume | 6 |
Issue number | 2 |
DOIs | |
State | Published - 1999 |
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Molecular Biology
- Genetics
- Computational Mathematics
- Computational Theory and Mathematics
Keywords
- Algorithms
- Consensus sequence
- DNA sequence recognition
- Pattern matching
- Tools for computational biology