Inducing the LCP-array

DOI10.1007/978-3-642-22300-6_32MaRDI QIDQ5199258zbMATH OpenOpenAlexWikidataFDO

Authors Johannes Fischer

Publication date 12 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_32

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Optimal suffix sorting and LCP array construction for constant alphabets
• Permuted Longest-Common-Prefix Array
• LCP array construction in external memory
• Algorithm Theory - SWAT 2004
• Better external memory LCP array construction

Cited in

(19)

• Searching and indexing circular patterns
• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• String inference from longest-common-prefix array
• String inference from longest-common-prefix array
• Fast and simple computations using prefix tables under Hamming and edit distance
• Inducing suffix and LCP arrays in external memory
• LCP array construction in external memory
• Longest common subsequence in at least \(k\) length order-isomorphic substrings
• Dichotomic Selection on Words: A Probabilistic Analysis
• Longest common prefix with mismatches
• Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
• Circular sequence comparison with \(q\)-grams
• Fast circular dictionary-matching algorithm
• Faster algorithms for 1-mappability of a sequence
• Optimal suffix sorting and LCP array construction for constant alphabets
• Alignment-free sequence comparison using absent words
• Burrows-Wheeler transform and LCP array construction in constant space
• Inducing the Lyndon array
• Inducing enhanced suffix arrays for string collections

This page was built for publication: Inducing the LCP-array

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