Open AccessFaster Algorithms for Longest Common Substring
Author(s) -
Maxime Crochemore,
Costas S. Iliopoulos,
Solon P. Pissis,
Jakub Radoszewski
Publication year - 2021
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - substring , suffix tree , combinatorics , compressed suffix array , integer (computer science) , sigma , string (physics) , alphabet , generalized suffix tree , suffix , mathematics , longest common subsequence problem , binary logarithm , algorithm , discrete mathematics , physics , data structure , computer science , linguistics , philosophy , quantum mechanics , mathematical physics , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom