✦ LIBER ✦

Compressed Suffix Trees with Full Functionality

✍ Scribed by Kunihiko Sadakane

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster Suffix Tree Construction with Mis

✍ Cole, Richard; Hariharan, Ramesh 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 185 KB

Truncated suffix trees and their applica

✍ Joong Chae Na; Alberto Apostolico; Costas S. Iliopoulos; Kunsoo Park 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Linearized Suffix Tree: an Efficient Ind

✍ Dong Kyue Kim; Minhwan Kim; Heejin Park 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 777 KB

On-line suffix tree construction with re

✍ Martin Senft; Tomáš Dvořák 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 210 KB

FULL TITLE(with Elsevier tree)

📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 36 KB

Representation of rational functions wit

✍ T. Harju; H.C.M. Kleijn; M. Latteux; A. Terlutte 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 686 KB