Sciweavers

178 search results - page 16 / 36
» Applications of Recursive Segmentation to the Analysis of DN...
Sort
View
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 7 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
CIKM
2009
Springer
15 years 5 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
CANDC
2008
ACM
15 years 2 months ago
'Genome order index' should not be used for defining compositional constraints in nucleotide sequences
Background: The Z-curve is a three dimensional representation of DNA sequences proposed over a decade ago and has been extensively applied to sequence segmentation, horizontal gen...
Eran Elhaik, Dan Graur, Kresimir Josic
ICIP
2006
IEEE
16 years 3 months ago
Color Blob Segmentation by MSER Analysis
This paper presents an efficient color blob segmentation concept, which combines an ordering relationship based on analyzing Bhattacharyya distances with a modified version of the...
Michael Donoser, Horst Bischof, Mario Wiltsche
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 3 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi