Sciweavers

995 search results - page 3 / 199
» String Pattern Discovery
Sort
View
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
13 years 10 months ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
13 years 10 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
MASCOTS
2010
13 years 7 months ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
CIAC
2010
Springer
194views Algorithms» more  CIAC 2010»
13 years 10 months ago
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Hui Zhang, Qing Guo, Costas S. Iliopoulos
BMCBI
2010
142views more  BMCBI 2010»
13 years 5 months ago
Classification of protein sequences by means of irredundant patterns
Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of diff...
Matteo Comin, Davide Verzotto