Sciweavers

17 search results - page 2 / 4
» Sequences with constant number of return words
Sort
View
DKE
2007
101views more  DKE 2007»
13 years 4 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
RECOMB
2009
Springer
14 years 5 months ago
Storage and Retrieval of Individual Genomes
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
Gonzalo Navarro, Jouni Sirén, Niko Väl...
IPL
2002
125views more  IPL 2002»
13 years 4 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
TRIER
2002
13 years 4 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm
WSOM
2009
Springer
13 years 11 months ago
Incremental Unsupervised Time Series Analysis Using Merge Growing Neural Gas
We propose Merge Growing Neural Gas (MGNG) as a novel unsupervised growing neural network for time series analysis. MGNG combines the state-of-the-art recursive temporal context of...
Andreas Andreakis, Nicolai von Hoyningen-Huene, Mi...