Výsledky vyhledávání

Fast algorithms for single and multiple pattern Cartesian tree matching

Autor: Thierry Lecroq, Siwoo Song, Simone Faro, Geonmo Gu, Cheol Ryu, Kunsoo Park

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 849, pp.47-63. ⟨10.1016/j.tcs.2020.10.009⟩

Cartesian tree matching is the problem of finding every substring of a given text which has the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms for single and multiple pattern Cartesian tree matching by introd

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2046ab984550efdf9a39174b39faf51
http://hdl.handle.net/20.500.11769/512341

Zobrazit plný text záznamu

Homomorphic Computation of Local Alignment

Autor: Jung Hee Cheon, Siwoo Song, Kunsoo Park, Sun Kim, Magsarjav Bataa, Miran Kim

Publikováno v: BIBM

In this paper we present a homomorphic computation algorithm that finds an optimal local alignment of a pair of encrypted sequences, based on the Smith-Waterman recurrence. Our algorithm also includes an efficient method of finding the location of an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c63cc5427802090211f577f44250b9eb
https://doi.org/10.1109/bibm49941.2020.9313199

Zobrazit plný text záznamu

Fast Multiple Pattern Cartesian Tree Matching

Autor: Thierry Lecroq, Simone Faro, Siwoo Song, Kunsoo Park, Geonmo Gu

Publikováno v: WALCOM: Algorithms and Computation ISBN: 9783030398804
WALCOM

Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesian tree matching for the case of multiple patterns. We present two fin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3a2b0acabff624e8b675553c90fbdf9
https://hal.archives-ouvertes.fr/hal-02361031

Zobrazit plný text záznamu

Fast Cartesian Tree Matching

Autor: Kunsoo Park, Simone Faro, Thierry Lecroq, Siwoo Song, Cheol Ryu

Publikováno v: String Processing and Information Retrieval ISBN: 9783030326852
SPIRE
SPIRE 2019
SPIRE 2019, pp.124-137, 2019, ⟨10.1007/978-3-030-32686-9_9⟩

Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time solution for Cartesian tree matching, which is based on the KMP algorithm

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c06e8a4d9a6684c54a79dbbd984d8944

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání