Algorithms – ESA 2004
From MaRDI portal
Publication:5464599
DOI10.1007/b100428zbMath1111.68795OpenAlexW2483610301MaRDI QIDQ5464599
Dina Sokol, Carmit Hazay, Moshe Lewenstein
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Related Items (11)
Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Unnamed Item ⋮ Verifying and enumerating parameterized border arrays ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Pattern matching with pair correlation distance ⋮ Parameterized matching on non-linear structures ⋮ A brief history of parameterized matching problems ⋮ Fast parameterized matching with \(q\)-grams ⋮ Cartesian Tree Matching and Indexing
This page was built for publication: Algorithms – ESA 2004
