Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Alberto Ordóñez
Faster Compressed Suffix Trees for Repetitive Text Collections
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Fully Compressed Suffix Trees
ACM Transactions on Algorithms
Mathematics
Annotated Suffix Tree as a Way of Text Representation for Information Retrieval in Text Collections
Business Informatics
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Faster Compressed Dictionary Matching
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Optimal Construction of Compressed Indexes for Highly Repetitive Texts
Alphabet-Independent Compressed Text Indexing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Modified LZW Algorithm for Efficient Compressed Text Retrieval
Contextual Exploration of Text Collections
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Mining Web Access Patterns Using Root-Set of Suffix Trees
International Journal of Computer Applications
