Sciweavers

516 search results - page 30 / 104
» Sets of k-Independent Strings
Sort
View
JDA
2008
87views more  JDA 2008»
13 years 7 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
SPIRE
2005
Springer
14 years 1 months ago
Linear Time Algorithm for the Generalised Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...
Inbok Lee, Yoan José Pinzón Ardila
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
12 years 10 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
ICDAR
2011
IEEE
12 years 7 months ago
HMM-Based Alignment of Inaccurate Transcriptions for Historical Documents
—For historical documents, available transcriptions typically are inaccurate when compared with the scanned document images. Not only the position of the words and sentences are ...
Andreas Fischer, Emanuel Indermühle, Volkmar ...

Publication
285views
13 years 11 months ago
Center of mass encoding: a self-adaptive representation with adjustable redundancy for real-valued parameters
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
Claudio Mattiussi, Peter Dürr, Dario Floreano