Sciweavers

8431 search results - page 219 / 1687
» Algorithmically Independent Sequences
Sort
View
JCB
2000
91views more  JCB 2000»
15 years 6 months ago
Scaling Laws and Similarity Detection in Sequence Alignment with Gaps
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...
Dirk Drasdo, Terence Hwa, Michael Lässig
BMCBI
2010
144views more  BMCBI 2010»
15 years 6 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
ICPR
2008
IEEE
16 years 7 months ago
A Hilbert warping method for camera-based finger-writing recognition
We propose a time-warping algorithm for recognizing finger actions by a camera. In the proposed method, an input image sequence is aligned to the reference sequences by phase-sync...
Hiroyuki Ishida, Tomokazu Takahashi, Ichiro Ide, H...
JSC
2002
61views more  JSC 2002»
15 years 6 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
CAI
2010
Springer
15 years 3 months ago
Constrained Longest Common Subsequence Computing Algorithms in Practice
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
Sebastian Deorowicz, J. Obstoj