Sciweavers

247 search results - page 1 / 50
» Incremental String Comparison
Sort
View
SIAMCOMP
1998
108views more  SIAMCOMP 1998»
13 years 10 months ago
Incremental String Comparison
Gad M. Landau, Eugene W. Myers, Jeanette P. Schmid...
FCT
2005
Springer
14 years 4 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
TCS
2002
13 years 10 months ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang
AUTOMATICA
2010
132views more  AUTOMATICA 2010»
13 years 11 months ago
A comparison between LQR control for a long string of SISO systems and LQR control of the infinite spatially invariant version
In this paper we consider a long string of SISO systems which in the limit becomes a scalar infinite spatially invariant system. We compare the LQR control for long-but-finite str...
Ruth F. Curtain, Orest V. Iftime, Hans Zwart
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
14 years 2 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson