Everything about LCP array

🧭 Start here: a 6-step reading path

1. Read the overview: LCP arrayA 5-minute orientation
2. Skim a recent paper: Reconstructing parameterized strings from parameterized suffix and LCP arraysInfluential work since 2022
3. Read the landmark paper: Reconfigurable RF MEMS Phased Array Antenna Integrated Within a Liquid Crystal Polymer (LCP) System-on-PackageCited 71 times
4. Go sideways: Suffix arrayA closely related topic
5. Go sideways: Generalized suffix arrayA closely related topic

🏆 Landmark papers (most cited)

• Reconfigurable RF MEMS Phased Array Antenna Integrated Within a Liquid Crystal Polymer (LCP) System-on-Package

  Nickolas Kingsley, George E. Ponchak, John Papapolymerou · 2008 · IEEE Transactions on Antennas and Propagation · 71 citations

• slaMEM: efficient retrieval of maximal exact matches using a sampled LCP array

  Francisco Fernandes, Ana T. Freitas · 2013 · Bioinformatics · 15 citations

• Optimal suffix sorting and LCP array construction for constant alphabets

  Felipe A. Louza, Simon Gog, Guilherme P. Telles · 2017 · Information Processing Letters · 14 citations

• Burrows–Wheeler transform and LCP array construction in constant space

  Felipe A. Louza, Travis Gagie, Guilherme P. Telles · 2017 · Journal of Discrete Algorithms · 8 citations

• LCP Array Construction in External Memory

  Juha Kärkkäinen, Dominik Kempa · 2016 · ACM Journal of Experimental Algorithmics · 7 citations

• Computing the multi-string BWT and LCP array in external memory

  Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola · 2021 · Theoretical Computer Science · 5 citations

• Better External Memory LCP Array Construction

  Juha Kärkkäinen, Dominik Kempa · 2019 · ACM Journal of Experimental Algorithmics · 3 citations

• A Novel Additive Technique to Fabricate 24-GHz Array Patch Antenna Using LCP Film

  Pandi Divya, Yi Wen Lai, Wen Hsi Lee · 2023 · IEEE Transactions on Components, Packaging and Manufacturing Technology · 2 citations

🆕 Influential since 2022

• Reconstructing parameterized strings from parameterized suffix and LCP arrays

  Amihood Amir, Eitan Kondratovsky, Gad M. Landau · 2024 · Theoretical Computer Science · 4 citations

• Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast

  Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis · 2026 · Algorithmica · 0 citations

• $$\tilde{O}(n)$$ Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays

  Amihood Amir, Eitan Kondratovsky, Shoshana Marcus · 2026 · Theory of Computing Systems · 0 citations

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
• Generalized suffix array In computer science, a generalized suffix array (GSA) is a suffix array containing all suffixes for a set of strings. Given the set of strings S = S 1…
• Longest common substring Wikibooks has a book on the topic of: Algorithm Implementation/Strings/Longest common substring In computer science, a longest common substring of two…
• Range minimum query In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range…
• Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
• Palindrome tree In computer science a palindrome tree, also called an EerTree, is a type of search tree, that allows for fast access to all palindromes contained in a…
• Compressed suffix array In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data…
• M-ary tree In graph theory, an m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary, k-way or generic tree) is an arborescence (or, for some authors…