New algorithms for efficient parallel string comparison
暂无分享,去创建一个
[1] Gad M. Landau,et al. Incremental String Comparison , 1998, SIAM J. Comput..
[2] Edson Cáceres,et al. A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem , 2006, Algorithmica.
[3] Alexander Tiskin. Semi-local longest common subsequences in subquadratic time , 2008, J. Discrete Algorithms.
[4] Alexander Tiskin,et al. Periodic String Comparison , 2009, CPM.
[5] David Semé. A CGM Algorithm Solving the Longest Increasing Subsequence Problem , 2006, ICCSA.
[6] William F. McColl,et al. Scalable Computing , 1995, Computer Science Today.
[7] Alexander Tiskin,et al. Fast Distance Multiplication of Unit-Monge Matrices , 2010, SODA '10.
[8] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[9] Mikhail J. Atallah,et al. Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..
[10] 김동규,et al. [서평]「Algorithms on Strings, Trees, and Sequences」 , 2000 .
[11] Alexander Tiskin,et al. Semi-local String Comparison: Algorithmic Techniques and Applications , 2007, Math. Comput. Sci..
[12] Thomas G. Szymanski,et al. A fast algorithm for computing longest common subsequences , 1977, CACM.
[13] Rainer E. Burkard,et al. Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..
[14] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[15] Edson Cáceres,et al. An all-substrings common subsequence algorithm , 2008, Discret. Appl. Math..
[16] Alok Aggarwal,et al. Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.
[17] Akihiro Fujiwara,et al. A Cost Optimal Parallel Algorithm for Patience Sorting , 2006, Parallel Process. Lett..
[18] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[19] Alexander Tiskin,et al. Efficient Parallel String Comparison , 2007, PARCO.
[20] Jeanette P. Schmidt,et al. All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings , 1998, SIAM J. Comput..
[21] Sergey Bereg,et al. Enumerating longest increasing subsequences and patience sorting , 2000, Inf. Process. Lett..
[22] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[23] Alexander Tiskin,et al. Parallel Longest Increasing Subsequences in Scalable Time and Memory , 2009, PPAM.
[24] Rob H. Bisseling,et al. Parallel scientific computation - a structured approach using BSP and MPI , 2004 .
[25] J. Hammersley. A few seedlings of research , 1972 .
[26] G. Szekeres,et al. A combinatorial problem in geometry , 2009 .