264 search results - page 24 / 53 » On the Complexity of Positional Sequencing by Hybridization |
154
click to vote
INTERSPEECH
2010
15 years 27 days ago
2010
We develop a similarity measure to detect repeatedly occurring Out-of-Vocabulary words (OOV), since these carry important information. Sub-word sequences in the recognition output...
260
Voted
GIS
2009
ACM
16 years 7 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
139
Voted
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
154
click to vote
FUZZIEEE
2007
IEEE
16 years 12 days ago
2007
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
158
click to vote
IJDMB
2008
15 years 6 months ago
2008
: Computational classification of proteins using methods such as string kernels and Fisher-SVM has demonstrated great success. However, the resulting models do not offer an immedia...