Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

96

CPM
2000
Springer

92views Combinatorics» more CPM 2000»

Finding Maximal Quasiperiodicities in Strings

15 years 6 months ago

Finding Maximal Quasiperiodicities in Strings

Download www.brics.dk

Gerth Stølting Brodal, Christian N. S. Pede

Real-time Traffic

Combinatorics | CPM 2000 |

claim paper

Related Content

» Finding approximate palindromes in strings

» Conservative String Covering of Indeterminate Strings

» External Memory Algorithms for String Problems

» Suffix Tree Characterization of Maximal Motifs in Biological Sequences

» Pointset algorithms for pattern discovery and pattern matching in music

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CPM
Authors	Gerth Stølting Brodal, Christian N. S. Pedersen

Comments (0)