N. Jesper Larsson  Home/Search
Context Related
| cs.lth.se/~jesper/thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dna.lth.se/~jesper/research (more) Homepages: N.Larsson |
Rate this article:      (best)Comment on this article |
Abstract: This doctoral dissertation presents a range of results concerning effi- cient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. It com- prises both theoretic results and practical implementations. We study the suffix tree data structure, presenting an efficient rep- resentation and several generalizations. This includes augmenting the suffix tree to fully support sliding window indexing (including a practi- cal... (Update)
Similar documents based on text: More All
0.5: Semantic and Generative Models for Lossy Text Compression - Witten, Bell, Moffat.. (1994) (Correct)
0.4: Some String Problems in Computational Biology - Lanctot (2004) (Correct)
0.4: Unbounded Length Contexts for PPM - Cleary, Teahun, Witten (1995) (Correct)
BibTeX entry: (Update)
N.J. Larsson. Structures of String Matching and Data Compression. PhD thesis, Dept. of Comp. Science, Lund Univ., 1999. http://citeseer.ist.psu.edu/larsson99structures.html More
@phdthesis{ larsson99structures,
author = "Larsson, N. Jesper",
title = "Structures of String Matching and Data Compression",
school = "Department of Computer Science, Lund University",
year = 1999,
address = "Sweden",
month = sep,
url = "citeseer.ist.psu.edu/larsson99structures.html" }
Citations (may not include all citations):56 Sorting in linear time - Andersson, Hagerup et al. - 1998
14 Efficient text searching of regular expressions (context) - Baeza-Yates, Gonnet
13 Longest-match string searching for Ziv-Lempel compression - Bell, Kulp - 1993
12 Efficient implementation of suffix trees - Andersson, Nilsson - 1995
12 The relationship between greedy parsing and symbolwise text .. (context) - Bell, Witten - 1994
12 Modifications of the Burrows and Wheeler data compression al.. - Balkenhol, Kurtz et al. - 1999
5 Block sorting and compression - Arnavut, Magliveras - 1997
4 Towards understanding and improving escape probabilities in .. (context) - berg, Shtarkov et al. - 1997
2 Suffix trees on words (context) - Andersson, Larsson et al.
1 inatorial Algorithms on Words (Alberto Apostolico and Zvi Ga.. (context) - Apostolico, virtues et al. - 1985
1 Greedy off-line textual substitution (context) - Apostolico, Lonardi - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dna.lth.se/~jesper/research.html): More
Offine Dictionary-Based Compression - Larsson, Moffat (Correct)
Attack Of The Mutant Suffix Trees - Larsson (1998) (Correct)
Notes On Suffix Sorting - Larsson (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC