acm.org
core.ac.uk
sci-hub.se 参考文章(23)
William Gasarch, None, Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) Sigact News. ,vol. 28, pp. 37- 40 ,(1997) , 10.1145/262301.1040343
Dan Gusfield, Algorithms on Strings, Trees, and Sequences: Suffix Trees and Their Uses ,(1997) , 10.1017/CBO9780511574931
Gary D. Stormo, Consensus patterns in DNA. Methods in Enzymology. ,vol. 183, pp. 211- 221 ,(1990) , 10.1016/0076-6879(90)83015-2
Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross Hardison, Webb Miller, A Linear-Time Algorithm for the 1-Mismatch Problem workshop on algorithms and data structures. pp. 126- 135 ,(1997) , 10.1007/3-540-63307-3_53
Amir Ben-Dor, Giuseppe Lancia, R. Ravi, Jennifer Perone, Banishing Bias from Consensus Sequences combinatorial pattern matching. pp. 247- 261 ,(1997) , 10.1007/3-540-63220-4_63
Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner, Approximation Algorithms for Multiple Sequence Alignment combinatorial pattern matching. pp. 43- 53 ,(1994) , 10.1007/3-540-58094-8_4
G. D. Stormo, G. W. Hartzell, Identifying protein-binding sites from unaligned DNA fragments. Proceedings of the National Academy of Sciences of the United States of America. ,vol. 86, pp. 1183- 1187 ,(1989) , 10.1073/PNAS.86.4.1183
Leszek Gąsieniec, Jesper Jansson, Andrzej Lingas, Efficient approximation algorithms for the Hamming center problem symposium on discrete algorithms. pp. 905- 906 ,(1999)
Pavel A. Pevzner, Multiple alignment, communication cost, and graph matching Siam Journal on Applied Mathematics. ,vol. 52, pp. 1763- 1779 ,(1992) , 10.1137/0152101
Dan Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology ,(1997)