Sciweavers

599 search results - page 1 / 120
» The repeater tree construction problem
Sort
View
IPL
2010
74views more  IPL 2010»
13 years 4 months ago
The repeater tree construction problem
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
Christoph Bartoschek, Stephan Held, Jens Maß...
SPIRE
2004
Springer
13 years 11 months ago
Linear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
ICMCS
2009
IEEE
250views Multimedia» more  ICMCS 2009»
13 years 3 months ago
Efficient sparse self-similarity matrix construction for repeating sequence detection
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
Lei Wang, Chng Eng Siong, Haizhou Li
JCB
2006
80views more  JCB 2006»
13 years 5 months ago
On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem
Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter
TCS
2008
13 years 5 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq