Implement longest common prefix algorithms

[krzysztof-turowski]

• Fischer - Inducing the LCP-Array
• Gog, Ohlebusch - Compressed Suffix Trees: Efficient Computation and Storage of LCP-Values (conference version: Fast and Lightweight LCP-Array Construction Algorithms)
• Manzini - Two Space Saving Tricks for Linear Time LCP Array Computation
• Puglisi, Turpin - Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
• Sadakane - Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays