Sciweavers

745 search results - page 6 / 149
» The origins of combinatorics on words
Sort
View
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
14 years 1 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 9 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
COMBINATORICS
2007
121views more  COMBINATORICS 2007»
13 years 9 months ago
A Bound for Size Ramsey Numbers of Multi-partite Graphs
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
Yuqin Sun, Yusheng Li
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
14 years 2 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
TRANSCI
2010
128views more  TRANSCI 2010»
13 years 8 months ago
An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
Xuesong Zhou, George F. List