Sciweavers

318 search results - page 18 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
98
Voted
BMCBI
2006
129views more  BMCBI 2006»
14 years 9 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
ICML
2002
IEEE
15 years 10 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
IJDAR
2007
127views more  IJDAR 2007»
14 years 9 months ago
Word matching using single closed contours for indexing handwritten historical documents
Abstract. Effective indexing is crucial for providing convenient access to scanned versions of large collections of handwritten historical manuscripts. Since traditional handwritin...
Tomasz Adamek, Noel E. O'Connor, Alan F. Smeaton
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
15 years 10 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...