1421 search results - page 121 / 285 » Algorithms for subsequence combinatorics |
143
click to vote
AMDO
2004
Springer
15 years 10 months ago
2004
Springer
In many product areas, a growing trend can be observed towards variant design, i.e. the development of customized designs based on variations of mature product models. We have deve...
156
click to vote
SSDBM
1999
IEEE
15 years 8 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
122
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
136
click to vote
COMAD
2008
15 years 6 months ago
2008
An important problem in biological data analysis is to predict the family of a newly discovered sequence like a protein or DNA sequence, using the collection of available sequence...
134
click to vote
BIOCOMP
2006
15 years 5 months ago
2006
Stochastic context-free grammar (SCFG) based models for non-coding RNA (ncRNA) gene searches are much more powerful than regular grammar based models due to the ability to model in...