82 search results - page 11 / 17 » A Fast Generic Sequence Matching Algorithm |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
112
click to vote
ISMB
1994
14 years 10 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
BMCBI
2008
14 years 9 months ago
2008
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
BMCBI
2006
14 years 9 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
102
click to vote
ACCV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...