How to answer a small batch of RMQs or LCA queries in practice
暂无分享,去创建一个
[1] Mireille Régnier,et al. New results on the size of tries , 1989, IEEE Trans. Inf. Theory.
[2] Steven Skiena,et al. Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.
[3] Robert E. Tarjan,et al. Scaling and related techniques for geometry problems , 1984, STOC '84.
[4] Alistair Moffat,et al. From Theory to Practice: Plug and Play with Succinct Data Structures , 2013, SEA.
[5] Solon P. Pissis,et al. MoTeX-II: structured MoTif eXtraction from large-scale datasets , 2014, BMC Bioinformatics.
[6] James A. M. McHugh,et al. A first approach to finding common motifs with gaps , 2004, Int. J. Found. Comput. Sci..
[7] Nodari Sitchinava,et al. I/O-Efficient Range Minima Queries , 2014, SWAT.
[8] Ron Y. Pinter,et al. Efficient String Matching with Don’t-Care Patterns , 1985 .
[9] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[10] Uzi Vishkin,et al. Recursive Star-Tree Parallel Data Structure , 1993, SIAM J. Comput..
[11] Alexandru I. Tomescu,et al. Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing , 2015 .
[12] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[13] Volker Heun,et al. Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE , 2006, CPM.
[14] Michael A. Bender,et al. The LCA Problem Revisited , 2000, LATIN.
[15] Solon P. Pissis,et al. Pattern Matching and Consensus Problems on Weighted Sequences and Profiles , 2018, Theory of Computing Systems.
[16] Gonzalo Navarro,et al. Improved Range Minimum Queries , 2016, 2016 Data Compression Conference (DCC).
[17] Costas S. Iliopoulos,et al. Fast circular dictionary-matching algorithm , 2015, Mathematical Structures in Computer Science.
[18] Naila Rahman,et al. A simple optimal representation for balanced parentheses , 2006, Theor. Comput. Sci..
[19] Peter Sanders,et al. On (Dynamic) Range Minimum Queries in External Memory , 2013, WADS.
[20] Maxime Crochemore,et al. Algorithms on strings , 2007 .
[21] Lucian Ilie,et al. The longest common extension problem revisited and applications to approximate string searching , 2010, J. Discrete Algorithms.