Sciweavers

60 search results - page 8 / 12
» combinatorics 1998
Sort
View
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
13 years 11 months ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
13 years 11 months ago
Pattern Matching in Text Compressed by Using Antidictionaries
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, ...
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 6 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 6 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
13 years 6 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...