Search

Your search keyword '"Thierry Lecroq"' showing total 12 results
Start Over Author "Thierry Lecroq" Publisher cambridge university press
12 results on '"Thierry Lecroq"'

1. Efficient Data Structures

Author

Thierry Lecroq, Wojciech Rytter, and Maxime Crochemore

Subjects
Theoretical computer science, Computer science, law, Suffix tree, Factor oracle, Suffix array, Suffix automaton, Data structure, law.invention
Published
2021
Full Text
View/download PDF

2. Suffix arrays

Author

Christophe Hancart, Maxime Crochemore, and Thierry Lecroq

Subjects
Compressed suffix array, law, Generalized suffix tree, Suffix array, String searching algorithm, Suffix, Computational geometry, Algorithm, FM-index, Mathematics, Longest common substring problem, law.invention
Published
2007
Full Text
View/download PDF

3. Alignments

Author

Christophe Hancart, Maxime Crochemore, and Thierry Lecroq

Subjects
Smith–Waterman algorithm, Longest common subsequence problem, Similarity (geometry), Kruskal's algorithm, Algorithmics, Subsequence, Symbolic computation, Computational geometry, Algorithm, Mathematics
Published
2007
Full Text
View/download PDF

4. Approximate patterns

Author

Christophe Hancart, Thierry Lecroq, and Maxime Crochemore

Subjects
law, Strassen algorithm, Suffix tree, Algorithmics, Hash function, Ukkonen's algorithm, Approximate string matching, Computational geometry, Symbolic computation, Algorithm, law.invention, Mathematics
Published
2007
Full Text
View/download PDF

5. Tools

Author

Thierry Lecroq, Maxime Crochemore, and Christophe Hancart

Subjects
Algorithmics, Concatenation, Regular expression, Pattern matching, Computational geometry, Symbolic computation, Algorithm, String (physics), Automaton, Mathematics
Published
2007
Full Text
View/download PDF

6. Pattern matching automata

Author

Christophe Hancart, Maxime Crochemore, and Thierry Lecroq

Subjects
Theoretical computer science, Computer science, Algorithmics, Trie, Pattern matching, Approximate string matching, Symbolic computation, Computational geometry, Algorithm, Automaton
Published
2007
Full Text
View/download PDF

7. Local periods

Author

Christophe Hancart, Maxime Crochemore, and Thierry Lecroq

Subjects
Combinatorics, law, Small class, Algorithmics, Suffix tree, Suffix array, Suffix automaton, Symbolic computation, Computational geometry, Algorithm, Mathematics, law.invention
Published
2007
Full Text
View/download PDF

8. Bibliography

Author

Christophe Hancart, Thierry Lecroq, and Maxime Crochemore

Subjects
Theoretical computer science, Algorithmics, Bibliography, Asymptotic computational complexity, Algorithm engineering, Symbolic computation, Computational geometry, Mathematics
Published
2007
Full Text
View/download PDF

9. Indexes

Author

Maxime Crochemore, Thierry Lecroq, and Christophe Hancart

Subjects
law, Algorithmics, Suffix tree, Suffix array, Suffix automaton, Computational geometry, Symbolic computation, Algorithm, Mathematics, law.invention
Published
2007
Full Text
View/download PDF

10. Preface

Author

Maxime Crochemore, Thierry Lecroq, and Christophe Hancart

Subjects
Theoretical computer science, Algorithmics, Algorithm engineering, Computational geometry, Symbolic computation, Mathematics
Published
2007
Full Text
View/download PDF

11. String searching with a sliding window

Author

Christophe Hancart, Thierry Lecroq, and Maxime Crochemore

Subjects
Algorithmics, Sliding window protocol, String searching algorithm, String metric, Approximate string matching, Symbolic computation, Computational geometry, String (physics), Algorithm, Mathematics
Published
2007
Full Text
View/download PDF

12. Algorithms on Strings

Author

Maxime Crochemore, Christophe Hancart, Thierry Lecroq, Maxime Crochemore, Christophe Hancart, and Thierry Lecroq

Subjects
Computational biology, Matching theory, Computer algorithms
Abstract

The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.

Published
2007

Catalog

Books, media, physical & digital resources
See catalog results