A Distributed Approach for Constructing Generalized Suffix Tree on Spark by Using Optimized Elastic Range Algorithm
暂无分享,去创建一个
[1] Tom White,et al. Hadoop: The Definitive Guide , 2009 .
[2] Hairong Kuang,et al. The Hadoop Distributed File System , 2010, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST).
[3] Michael J. Franklin,et al. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.
[4] Chris Upton,et al. Suffix tree searcher: exploration of common substrings in large DNA sequence sets , 2014, BMC Research Notes.
[5] Takuya Kida. Suffix Tree Based VF-Coding for Compressed Pattern Matching , 2009, 2009 Data Compression Conference.
[6] Scott Shenker,et al. Spark: Cluster Computing with Working Sets , 2010, HotCloud.
[7] Wojciech Szpankowski,et al. A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors , 1993, SIAM J. Comput..
[8] Alex Thomo,et al. Suffix trees for very large genomic sequences , 2009, CIKM.
[9] Konstantin Makarychev,et al. Serial and parallel methods for i/o efficient suffix tree construction , 2009, SIGMOD Conference.
[10] M. Crochemore,et al. On-line construction of suffix trees , 2002 .
[11] Panos Kalnis,et al. ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings , 2011, Proc. VLDB Endow..
[12] Reda Alhajj,et al. STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databases , 2010, Applied Intelligence.