4234 search results - page 182 / 847 » OLAP on sequence data |
162
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
147
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
135
Voted
FATES
2003
Springer
15 years 8 months ago
2003
Springer
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
127
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
105
Voted
AVI
2008
15 years 5 months ago
2008
In many applications transactions between the elements of an information hierarchy occur over time. For example, the product offers of a department store can be organized into pro...