Sciweavers

249 search results - page 1 / 50
» Finding Patterns in Given Intervals
Sort
View
MFCS
2007
Springer
13 years 11 months ago
Finding Patterns in Given Intervals
In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with th...
Maxime Crochemore, Costas S. Iliopoulos, M. Sohel ...
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
14 years 6 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
13 years 9 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
CCCG
2008
13 years 6 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
TCSB
2008
13 years 5 months ago
Clustering Time-Series Gene Expression Data with Unequal Time Intervals
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
Luis Rueda, Ataul Bari, Alioune Ngom