Sciweavers

82 search results - page 10 / 17
» A Fast Generic Sequence Matching Algorithm
Sort
View
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
15 years 3 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
15 years 4 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
CP
2003
Springer
15 years 4 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
TCSV
2002
229views more  TCSV 2002»
14 years 11 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 4 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang