166 search results - page 10 / 34 » Suffix trees for very large genomic sequences |
RECOMB
2004
Springer
16 years 18 hour ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
105
click to vote
BIBM
2010
IEEE
14 years 9 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
110
click to vote
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
109
click to vote
WEA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
RECOMB
2010
Springer
15 years 6 months ago
2010
Springer
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...