A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
暂无分享,去创建一个
[1] Uzi Vishkin,et al. Highly parallelizable problems , 1989, STOC '89.
[2] S Karlin,et al. Methods and algorithms for statistical analysis of protein sequences. , 1992, Proceedings of the National Academy of Sciences of the United States of America.
[3] S. Karlin,et al. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. , 1990, Proceedings of the National Academy of Sciences of the United States of America.
[4] Selim G. Akl,et al. Application of Broadcasting with Selective Reduction to the Maximal Sum Subsegment Problem , 1991, Int. J. High Speed Comput..
[5] Danny Ziyi Chen,et al. Efficient Geometric Algorithms on the EREW PRAM , 1995, IEEE Trans. Parallel Distributed Syst..
[6] Walter L. Ruzzo,et al. A Linear Time Algorithm for Finding All Maximal Scoring Subsequences , 1999, ISMB.
[7] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[8] S. Karlin,et al. Chance and statistical significance in protein and DNA sequence analysis. , 1992, Science.
[9] S. Karlin,et al. Applications and statistics for multiple high-scoring segments in molecular sequences. , 1993, Proceedings of the National Academy of Sciences of the United States of America.
[10] Amir Dembo,et al. LIMIT DISTRIBUTIONS OF MAXIMAL SEGMENTAL SCORE AMONG MARKOV-DEPENDENT PARTIAL SUMS , 1992 .
[11] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .