@incollection{Kasai_2001,
    doi = {10.1007/3-540-48194-x_17},
    url = {https://doi.org/10.1007%2F3-540-48194-x_17},
    year = {2001},
    publisher = {Springer Berlin Heidelberg},
    pages = {181--192},
    author = {Toru Kasai and Gunho Lee and Hiroki Arimura and Setsuo Arikawa and Kunsoo Park},
    title = {Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications},
    booktitle = {Combinatorial Pattern Matching}
}

@incollection{Kasai_2001, doi = {10.1007/3-540-48194-x_17}, url = {https://doi.org/10.1007%2F3-540-48194-x_17}, year = {2001}, publisher = {Springer Berlin Heidelberg}, pages = {181--192}, author = {Toru Kasai and Gunho Lee and Hiroki Arimura and Setsuo Arikawa and Kunsoo Park}, title = {Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications}, booktitle = {Combinatorial Pattern Matching} }