The longest common substring problem (Q2971067)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The longest common substring problem	scientific article

Statements

scholarly article

0 references

The longest common substring problem (English)

0 references

Maxime Crochemore

0 references

Costas S. Iliopoulos

0 references

0 references

Filippo Mignosi

0 references

Mathematical Structures in Computer Science

0 references

publication date

4 April 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

Practical compressed suffix trees

0 references

Replacing suffix trees with enhanced suffix arrays

0 references

On Finding Lowest Common Ancestors in Trees

0 references

Automata, Languages and Programming

0 references

A simple and efficient union-find-delete algorithm

0 references

0 references

Recursive Star-Tree Parallel Data Structure

0 references

Near real-time suffix tree construction via the fringe marked ancestor problem

0 references

Algorithms on Strings

0 references

A general approach to connected-component labeling for arbitrary image representations

0 references

On the sorting-complexity of suffix tree construction

0 references

Two linear time Union--Find strategies for image processing

0 references

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE

0 references

A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array

0 references

0 references

Faster entropy-bounded compressed suffix trees

0 references

A linear-time algorithm for a special case of disjoint set union

0 references

Colored range queries and document retrieval

0 references

Compressed suffix trees

0 references

LATIN 2000: Theoretical informatics. 4th Latin American symposium, Punta del Este, Uruguay, April 10--14, 2000. Proceedings

0 references

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

0 references

Algorithms on Strings, Trees and Sequences

0 references

Efficient Union-Find for planar graphs and other sparse graph classes

0 references

Fast Algorithms for Finding Nearest Common Ancestors

0 references

0 references

Linear work suffix array construction

0 references

Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays

0 references

Combinatorial Pattern Matching

0 references

Constructing suffix arrays in linear time

0 references

Space efficient linear time construction of suffix arrays

0 references

THE VIRTUAL SUFFIX TREE

0 references

Linearity and Unprovability of Set Union Problem Strategies

0 references

Postorder Disjoint Set Union is Linear

0 references

Suffix Arrays: A New Method for On-Line String Searches

0 references

A Space-Economical Suffix Tree Construction Algorithm

0 references

Spaces, Trees, and Colors

0 references

Compressed representations of sequences and full-text indexes

0 references

0 references

Fully compressed suffix trees

0 references

Compressed suffix trees with full functionality

0 references

On Finding Lowest Common Ancestors: Simplification and Parallelization

0 references

A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors

0 references

Special issue: Average-case analysis of algorithms

0 references

On-line construction of suffix trees

0 references

full work available at URL

https://doi.org/10.1017/s0960129515000110

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0960129515000110

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/mscs/CrochemoreILM17

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2971067

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971067&oldid=39638466"