Name
Abstract | ||
|---|---|---|
•A new variant of approximate palindromes called single-arm-gapped palindromes.•Efficient algorithms to compute maximal single-arm-gapped palindromes in a string.•Experimental results to compare the proposed methods in practice. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.tcs.2019.10.025 | Theoretical Computer Science |
Keywords | Field | DocType |
String algorithms,Palindromes,Suffix trees,Suffix arrays | Discrete mathematics,Combinatorics,Suffix,Empty string,Palindrome,Single character,Time complexity,Mathematics,Computation | Journal |
Volume | ISSN | Citations |
812 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shintaro Narisada | 1 | 1 | 1.09 |
| Diptarama Hendrian | 2 | 0 | 2.70 |
| Kazuyuki Narisawa | 3 | 33 | 6.82 |
| Shunsuke Inenaga | 4 | 595 | 79.02 |
| Ayumi Shinohara | 5 | 936 | 88.28 |