Sciweavers

1700 search results - page 16 / 340
» Combinatorial Pattern Matching
Sort
View
FCT
2005
Springer
14 years 1 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
WEBI
2005
Springer
14 years 1 months ago
Efficient Extraction of Closed Motivic Patterns in Multi-Dimensional Symbolic Representations of Music
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
Olivier Lartillot
TCBB
2008
76views more  TCBB 2008»
13 years 7 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir
PR
2008
206views more  PR 2008»
13 years 7 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
GECCO
2009
Springer
13 years 11 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom