A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..
[2] Enno Ohlebusch,et al. Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.
[3] Stephen Alstrup,et al. Nearest common ancestors: a survey and a new distributed algorithm , 2002, SPAA.
[4] Uzi Vishkin,et al. Recursive Star-Tree Parallel Data Structure , 1993, SIAM J. Comput..
[5] Gonzalo Navarro,et al. Compressed full-text indexes , 2007, CSUR.
[6] Steven Skiena,et al. Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.
[7] Robert E. Tarjan,et al. Scaling and related techniques for geometry problems , 1984, STOC '84.
[8] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[9] Hiroki Arimura,et al. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.
[10] Kunihiko Sadakane,et al. Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.
[11] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[12] S. Muthukrishnan,et al. Efficient algorithms for document retrieval problems , 2002, SODA '02.
[13] Kuan-Yu Chen,et al. On the range maximum-sum segment query problem , 2007, Discret. Appl. Math..
[14] Andrew Chi-Chih Yao,et al. Should Tables Be Sorted? , 1981, JACM.
[15] Volker Heun,et al. Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE , 2006, CPM.
[16] Kunihiko Sadakane,et al. Space-Efficient Data Structures for Flexible Text Retrieval Systems , 2002, ISAAC.
[17] Kunihiko Sadakane,et al. Succinct representations of lcp information and improvements in the compressed suffix arrays , 2002, SODA '02.