Sciweavers

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

13

STRINGOLOGY
2008

favoriteEmaildiscussreport

132views Programming Languages» more STRINGOLOGY 2008»

Fast Optimal Algorithms for Computing All the Repeats in a String

13 years 6 months ago

Fast Optimal Algorithms for Computing All the Repeats in a String

Download www.stringology.org

Simon J. Puglisi, William F. Smyth, Munina Yusufu

Real-time Traffic

Programming Languages | STRINGOLOGY 2008 |

claim paper

Related Content

» Compression of Strings with Approximate Repeats

» String and permutationcoded genetic algorithms for the static weapontarget assignment prob...

» A genetic algorithm for the longest common subsequence problem

» Simple and Fast Inverse Alignment

» String Noninclusion Optimization Problems

» A Fast Algorithm for Approximate String Matching on Gene Sequences

» Freeze engineering a fast repeater insertion solver for power minimization using the ellip...

» Approximate String Membership Checking A Multiple Filter OptimizationBased Approach

» A Fast BitVector Algorithm for Approximate String Matching Based on Dynamic Programming

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	STRINGOLOGY
Authors	Simon J. Puglisi, William F. Smyth, Munina Yusufu

Comments (0)