Publications
Detailed Information
Fast multiple pattern cartesian tree matching
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gu, Geonmo | - |
dc.contributor.author | Song, Siwoo | - |
dc.contributor.author | Faro, Simone | - |
dc.contributor.author | Lecroq, Thierry | - |
dc.contributor.author | Park, Kunsoo | - |
dc.date.accessioned | 2022-10-17T03:51:29Z | - |
dc.date.available | 2022-10-17T03:51:29Z | - |
dc.date.created | 2022-06-07 | - |
dc.date.issued | 2020-01 | - |
dc.identifier.citation | Lecture Notes in Computer Science, Vol.12049 LNCS, pp.107-119 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://hdl.handle.net/10371/186081 | - |
dc.description.abstract | © Springer Nature Switzerland AG 2020.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 fingerprinting methods, i.e., the parent-distance encoding and the binary encoding. By combining an efficient fingerprinting method and a conventional multiple string matching algorithm, we can efficiently solve multiple pattern Cartesian tree matching. We propose three practical algorithms for multiple pattern Cartesian tree matching based on the Wu-Manber algorithm, the Rabin-Karp algorithm, and the Alpha Skip Search algorithm, respectively. In the experiments we compare our solutions against the previous algorithm [18]. Our solutions run faster than the previous algorithm as the pattern lengths increase. Especially, our algorithm based on Wu-Manber runs up to 33 times faster. | - |
dc.language | 영어 | - |
dc.publisher | Springer Verlag | - |
dc.title | Fast multiple pattern cartesian tree matching | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/978-3-030-39881-1_10 | - |
dc.citation.journaltitle | Lecture Notes in Computer Science | - |
dc.identifier.wosid | 000663418900010 | - |
dc.identifier.scopusid | 2-s2.0-85080923608 | - |
dc.citation.endpage | 119 | - |
dc.citation.startpage | 107 | - |
dc.citation.volume | 12049 LNCS | - |
dc.description.isOpenAccess | N | - |
dc.contributor.affiliatedAuthor | Park, Kunsoo | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.