Longest Common Extensions in Partial Words

DOI10.1007/978-3-319-29516-9_5MaRDI QIDQ2798218zbMATH OpenOpenAlexFDO

Authors Rachel Harred, Justin Lazarow, F. Blanchet-Sadri

Publication date 4 April 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29516-9_5

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Computing longest common extensions in partial words
• A note on the longest common compatible prefix problem for partial words
• Longest common subsequences in sets of words
• Longest common extension
• scientific article; zbMATH DE number 4007744
• Longest common prefix with mismatches
• Suffix trees for partial words and the longest common compatible prefix problem
• Length of the longest common subsequence between overlapping words
• Maximal length of common words among random letter sequences
• Longest common extensions with recompression

Cited in

(10)

• Extended strings and admissible words
• Computing longest common extensions in partial words
• Longest common extension
• Most common words -- a cP systems solution
• Defining long words succinctly in FO and MSO
• scientific article; zbMATH DE number 5125588 (Why is no real title available?)
• Suffix trees for partial words and the longest common compatible prefix problem
• A note on the longest common compatible prefix problem for partial words
• Long twins in random words
• Longest common extensions with wildcards: trade-off and applications

This page was built for publication: Longest Common Extensions in Partial Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798218)