Searching for authors named "Maxime Crochemore" – sorted by Relevance.
49 documents found, showing 1 through 10.
Next 10 →
-
Reducing Space for Index Implementation
- …This article considers several strategies to implement efficiently full indexes on raw textual data. Indexes are based on representations of all the suffixes of the original text, for which we describe three types of implementations aimed at reducing the memory space. The first method is a combinati…
- Cited by 4 (1 self) – Add To MetaCart
-
Motifs in Sequences: Localization and Extraction
- ……
- Cited by 8 (1 self) – Add To MetaCart
-
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
- …The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of 3 2 n text characters comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of…
- Cited by 2 (1 self) – Add To MetaCart
-
On the size of DASG for multiple texts
- …We present a left-to-right algorithm building the automaton accepting all subsequences of a given set of strings. We prove that the number of states of this automaton can be quadratic if built on at least two texts.…
- Cited by 3 (0 self) – Add To MetaCart
-
String Pattern Matching For A Deluge Survival Kit
- …String Pattern Matching concerns itself with algorithmic and combinatorial issues related to matching and searching on linearly arranged sequences of symbols, arguably the simplest possible discrete structures. As unprecedented volumes of sequence data are amassed, disseminated and shared at an incr…
- Cited by 3 (1 self) – Add To MetaCart
-
Improved Antidictionary Based Compression
- …The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called "antifactors") never appear in the text. Let sb be an antifactor, where b is its last bit. Every time s appears in the text we know that the next bit is b and hence omit its rep…
- Cited by 1 (0 self) – Add To MetaCart
-
Directed Acyclic Subsequence Graph for multiple texts
- …The subsequence matching problem is to decide, for given strings S and T , whether S is a subsequence of T . The string S is called pattern and the string T text. We consider the case of multiple texts and show how to solve the subsequence matching problem in time linear in the length of pattern.…
- Cited by 8 (0 self) – Add To MetaCart
-
Text Data Compression Algorithms
- …Contents 1 Text compression 3 2 Static Huffman coding 5 2.1 Encoding : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2 Decoding : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 3 Dynamic Huffman coding 12 3.1 Encoding : : : : : : :…
- Cited by 1 (0 self) – Add To MetaCart
-
Computing longest previous factor in linear time and applications
- …Abstract. We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of the longest factor of w starting at position i that occurs previously in w. Several properties and applications …
- Cited by 1 (1 self) – Add To MetaCart
-
Minimizing incomplete automata
- …We develop a O(m log n)-time and O(k + n + m)-space algorithm for minimizing incomplete deterministic automata, where n is the number of states, m the number of edges, and k the size of the alphabet. Minimization reduces to the partial Functional coarsest partition problem. Our algorithm is a slight…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
