2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2018★ 1 cited
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk
Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka +1
We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk of that graph. It has been known that this problem is solvable in $O(n \l…
cs.DS2016★ 2 cited
Efficient computation of longest single-arm-gapped palindromes in a string
Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa +2
In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which…