Sciweavers

72 search results - page 8 / 15
» Permutations Avoiding Two Patterns of Length Three
Sort
View
DAM
2008
75views more  DAM 2008»
13 years 7 months ago
Patterns of simple gene assembly in ciliates
The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: the molec...
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz ...
DNA
2005
Springer
117views Bioinformatics» more  DNA 2005»
14 years 1 months ago
Simple Operations for Gene Assembly
Abstract. The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: ...
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz ...
PR
2006
132views more  PR 2006»
13 years 7 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 8 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
SPIRE
2009
Springer
14 years 2 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...