7 citations · 11 across the 8 of their papers we have counts for
10 papers
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming
Seunghwan Min, Sung Gwan Park, Kunsoo Park +3
In many real datasets such as social media streams and cyber data sources, graphs change over time through a graph update stream of edge insertions and deletions. Detecting critica…
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs
Sangsoo Park, Sung Gwan Park, Bastien Cazaux +2
The hierarchical overlap graph (HOG) is a graph that encodes overlaps from a given set P of n strings, as the overlap graph does. A best known algorithm constructs HOG in O(||P|| l…
Compressed Key Sort and Fast Index Reconstruction
Yongsik Kwon, Cheol Ryu, Sang Kyun Cha +3
In this paper we propose an index key compression scheme based on the notion of distinction bits by proving that the distinction bits of index keys are sufficient information to de…
Fast Multiple Pattern Cartesian Tree Matching
Geonmo Gu, Siwoo Song, Simone Faro +2
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 Cartesi…
Fast Cartesian Tree Matching
Siwoo Song, Cheol Ryu, Simone Faro +2
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 sol…
Cartesian Tree Matching and Indexing
Sung Gwan Park, Amihood Amir, Gad M. Landau +1
We introduce a new metric of match, called Cartesian tree matching, which means that two strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we d…