✦ LIBER ✦

Fast, Practical Algorithms for Computing All the Repeats in a String

✍ Scribed by Simon J. Puglisi; W. F. Smyth; Munina Yusufu

Book ID: 107508909
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 1024 KB
Volume: 3
Category: Article
ISSN: 1661-8270
DOI: 10.1007/s11786-010-0033-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A work-time optimal algorithm for comput

A work-time optimal algorithm for computing all string covers

✍ Costas S. Iliopoulos; Kunsoo Park 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 851 KB

A fast algorithm for repeated computatio

A fast algorithm for repeated computation of linear recurrence relations

✍ Jozef Mikloško 📂 Article 📅 1977 🏛 Springer Netherlands 🌐 English ⚖ 333 KB

An optimal algorithm to compute all the

An optimal algorithm to compute all the covers of a string

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB

Fast algorithms for computing the constr

Fast algorithms for computing the constrained LCS of run-length encoded strings

✍ Hsing-Yen Ann; Chang-Biau Yang; Chiou-Ting Tseng; Chiou-Yi Hor 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 540 KB

A Fast Algorithm for the Optimal Alignme

A Fast Algorithm for the Optimal Alignment of Three Strings

✍ Lloyd Allison 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 272 KB

LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg

Fast algorithms for computing the diamet

Fast algorithms for computing the diameter of a finite planar set

✍ Binay K. Bhattacharya; Godfried T. Toussaint 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 792 KB