• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 230
Next 10 →

Suffix Array of Alignment: A Practical Index for Similar Data

by Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, Kunsoo Park
"... Abstract. The suffix tree of alignment is an index data structure for similar strings. Given an alignment of similar strings, it stores all suf-fixes of the alignment, called alignment-suffixes. An alignment-suffix rep-resents one suffix of a string or suffixes of multiple strings starting at the sa ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract. The suffix tree of alignment is an index data structure for similar strings. Given an alignment of similar strings, it stores all suf-fixes of the alignment, called alignment-suffixes. An alignment-suffix rep-resents one suffix of a string or suffixes of multiple strings starting

Dynamic Extended Suffix Arrays

by M. Salson , et al. , 2009
"... The suffix tree data structure has been intensively described, studied and used in the eighties and nineties, its linear-time construction counterbalancing his space-consuming requirements. An equivalent data structure, the suffix array, has been described by Manber and Myers in 1990. This space-eco ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
letter or a factor). This algorithm is based on a recent four-stage algorithm developed for dynamic Burrows-Wheeler Transforms (BWT). For minimizing the space complexity, we are sampling the Suffix Array, a technique used in BWT-based compressed indexes. We furthermore explain how this technique can

Compressed Spaced Suffix Arrays

by Travis Gagie, Giovanni Manzini, Daniel Valenzuela , 2014
"... Spaced seeds are important tools for similarity search in bioinformatics, and using several seeds together often significantly improves their performance. With existing approaches, however, for each seed we keep a separate linear-size data structure, either a hash table or a spaced suffix array (SSA ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Spaced seeds are important tools for similarity search in bioinformatics, and using several seeds together often significantly improves their performance. With existing approaches, however, for each seed we keep a separate linear-size data structure, either a hash table or a spaced suffix array

Succinct suffix arrays based on run-length encoding

by Veli Mäkinen, Gonzalo Navarro - Nordic Journal of Computing , 2005
"... A succinct full-text self-index is a data structure built on a text T = t1t2...tn, which takes little space (ideally close to that of the compressed text), permits efficient search for the occurrences of a pattern P = p1p2... pm in T, and is able to reproduce any text substring, so the self-index re ..."
Abstract - Cited by 60 (32 self) - Add to MetaCart
and some regularities that show up in their suffix arrays and in the Burrows-Wheeler transform of T. This relationship is of independent interest and permits bounding the space occupancy of the RLFM index, as well as that of other existing compressed indexes. Finally, we present some practical

Engineering a lightweight suffix array construction algorithm (Extended Abstract)

by Giovanni Manzini, Paolo Ferragina
"... In this paper we consider the problem of computing the suffix array of a text T [1, n]. This problem consists in sorting the suffixes of T in lexicographic order. The suffix array [16] (or pat array [9]) is a simple, easy to code, and elegant data structure used for several fundamental string matchi ..."
Abstract - Cited by 81 (3 self) - Add to MetaCart
In this paper we consider the problem of computing the suffix array of a text T [1, n]. This problem consists in sorting the suffixes of T in lexicographic order. The suffix array [16] (or pat array [9]) is a simple, easy to code, and elegant data structure used for several fundamental string

When indexing equals compression: Experiments with compressing suffix arrays and applications

by Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter , 2004
"... We report on a new and improved version of high-order entropy-compressed suffix arrays, which has theoretical performance guarantees similar to those in our earlier work [16], yet represents an improvement in practice. Our experiments indicate that the resulting text index offers state-of-the-art co ..."
Abstract - Cited by 46 (5 self) - Add to MetaCart
We report on a new and improved version of high-order entropy-compressed suffix arrays, which has theoretical performance guarantees similar to those in our earlier work [16], yet represents an improvement in practice. Our experiments indicate that the resulting text index offers state

Robust record linkage blocking using suffix arrays and Bloom filters

by Timothy De Vries, Hui Ke, Peter Christen, Sanjay Chawla - ACM TKDD
"... Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, a quadratic scalability for the brute force approach necessitates the design of appropriate indexing or blocking techniques. We desig ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
array method. Efficiently grouping similar suffixes is carried out with the use of a sliding window technique. We carry out an in-depth analysis of our method and show results from experiments using real and synthetic data, which highlights the importance of using efficient indexing and blocking in real

Linearized suffix tree: an efficient . . .

by Dong Kyue Kim , Minhwan Kim , Heejin Park - ALGORITHMICA , 2008
"... Suffix trees and suffix arrays are fundamental full-text index data struc-tures to solve problems occurring in string processing. Since suffix trees and suffix arrays have different capabilities, some problems are solved more efficiently using suffix trees and others are solved more efficiently us ..."
Abstract - Add to MetaCart
are efficient index data struc-tures with the capabilities of both suffix trees and suffix arrays even when the size of an alphabet is large. A linearized suffix tree has all the functionalities of the enhanced suffix array and supports the pattern search in O(m log ||) time. In a different point of view

Generalizations of Suffix Arrays to Multi-Dimensional Matrices

by Dong Kyue Kim , Yoo Ah Kim , Kunsoo Park
"... We propose multi-dimensional index data structures that generalize suffix arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsuffix tree, that generalizes suffix trees to square matrices. However, the construction algorithm for Lsuffix trees ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We propose multi-dimensional index data structures that generalize suffix arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsuffix tree, that generalizes suffix trees to square matrices. However, the construction algorithm for Lsuffix

Abstract An Incomplex Algorithm for Fast Suffix Array Construction

by unknown authors
"... Our aim is to provide full text indexing data structures and algorithms for universal usage in text indexing. We present a practical algorithm for suffix array construction. The fundamental algorithm is less complex than other construction algorithms. We achieve very fast construction times for comm ..."
Abstract - Add to MetaCart
Our aim is to provide full text indexing data structures and algorithms for universal usage in text indexing. We present a practical algorithm for suffix array construction. The fundamental algorithm is less complex than other construction algorithms. We achieve very fast construction times
Next 10 →
Results 1 - 10 of 230
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University