Linear-Time Construction of Two-Dimensional Suffix Trees

被引：0
作者：
Dong Kyue Kim
Joong Chae Na
Jeong Seop Sim
Kunsoo Park
机构：
[1] Hanyang University,Department of Electronics and Communications Engineering
[2] Sejong University,Department of Computer Science and Engineering
[3] Inha University,School of Computer and Information Engineering
[4] Seoul National University,School of Computer Science and Engineering
来源：
Algorithmica | 2011年 / 59卷
关键词：
Suffix tree; Two-dimensional suffix tree; Divide-and-conquer approach;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The two-dimensional suffix tree of a matrix A is a compacted tree that represents all square submatrices of A. We present the first complete version of a deterministic linear-time algorithm to construct the two-dimensional suffix tree by applying a divide-and-conquer approach.
引用
收藏
页码：269 / 297
页数：28
相关论文
共 41 条
[31]  
Na J.C.(undefined)undefined undefined undefined undefined-undefined
[32]  
Giancarlo R.(undefined)undefined undefined undefined undefined-undefined
[33]  
Park K.(undefined)undefined undefined undefined undefined-undefined
[34]  
Rodeh M.(undefined)undefined undefined undefined undefined-undefined
[35]  
Pratt V.R.(undefined)undefined undefined undefined undefined-undefined
[36]  
Even S.(undefined)undefined undefined undefined undefined-undefined
[37]  
Schieber B.(undefined)undefined undefined undefined undefined-undefined
[38]  
Vishkin U.(undefined)undefined undefined undefined undefined-undefined
[39]  
Sleator D.D.(undefined)undefined undefined undefined undefined-undefined
[40]  
Tarjan R.E.(undefined)undefined undefined undefined undefined-undefined
12345