Name
Abstract | ||
|---|---|---|
DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multipattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74450-4_25 | ESCAPE |
Keywords | DocType | Volume |
important task,fast string,encoded dna sequence,important factor,dna sequence,decode dna sequence,efficient storage,multipattern matching approach,suffix approach,different species,string matching,pattern matching | Conference | 36 |
Issue | ISSN | ISBN |
4 | 0302-9743 | 3-540-74449-5 |
Citations | PageRank | References |
7 | 0.63 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Wook Kim | 1 | 63 | 11.26 |
| Eunsang Kim | 2 | 8 | 1.33 |
| Kunsoo Park | 3 | 1396 | 171.00 |