Data Structures & Algorithms
暂无分享,去创建一个
[1] Alan L. Yuille,et al. Feature extraction from faces using deformable templates , 2004, International Journal of Computer Vision.
[2] Uri Keich,et al. U Subtle motifs: defining the limits of motif finding algorithms , 2002, Bioinform..
[3] Ellis Horowitz,et al. Fundamentals of data structures in C , 1976 .
[4] Gary D. Stormo,et al. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences , 1999, Bioinform..
[5] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[6] Jeremy Buhler,et al. Search algorithms for biosequences using random projection , 2001 .
[7] Jun S. Liu,et al. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. , 1993, Science.
[8] J. Collado-Vides,et al. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. , 1998, Journal of molecular biology.
[9] Aris Floratos,et al. Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm [published erratum appears in Bioinformatics 1998;14(2): 229] , 1998, Bioinform..
[10] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[11] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[12] Mikhail S. Gelfand,et al. Finding Weak Motifs in DNA Sequences , 2001, Pacific Symposium on Biocomputing.
[13] Gilles Brassard,et al. Algorithmics - theory and practice , 1988 .
[14] G. Stormo,et al. Identifying protein-binding sites from unaligned DNA fragments. , 1989, Proceedings of the National Academy of Sciences of the United States of America.
[15] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[16] E. Koonin,et al. Prediction of transcription regulatory sites in Archaea by a comparative genomic approach. , 2000, Nucleic acids research.
[17] Hanah Margalit,et al. Identification of common motifs in unaligned DNA sequences: application to Escherichia coli Lrp regulon , 1995, Comput. Appl. Biosci..
[18] Benno Schwikowski,et al. Algorithms for Phylogenetic Footprinting , 2002, J. Comput. Biol..
[19] G. Pesole,et al. WORDUP: an efficient algorithm for discovering statistically significant patterns in DNA sequences. , 1992, Nucleic acids research.
[20] David R. Gilbert,et al. Approaches to the Automatic Discovery of Patterns in Biosequences , 1998, J. Comput. Biol..
[21] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[22] Bin Ma,et al. Finding similar regions in many strings , 1999, STOC '99.
[23] Gary D. Stormo,et al. DNA binding sites: representation and discovery , 2000, Bioinform..
[24] M. Waterman,et al. Rigorous pattern-recognition methods for DNA sequences. Analysis of promoter sequences from Escherichia coli. , 1985, Journal of molecular biology.
[25] Jeremy Buhler,et al. Finding Motifs Using Random Projections , 2002, J. Comput. Biol..
[26] A. D. McLachlan,et al. Profile analysis: detection of distantly related proteins. , 1987, Proceedings of the National Academy of Sciences of the United States of America.
[27] Pavel A. Pevzner,et al. Combinatorial Approaches to Finding Subtle Signals in DNA Sequences , 2000, ISMB.
[28] M. Waterman,et al. Pattern recognition in several sequences: consensus and alignment. , 1984, Bulletin of mathematical biology.
[29] R. Prim. Shortest connection networks and some generalizations , 1957 .
[30] Charles Elkan,et al. Unsupervised learning of multiple motifs in biopolymers using expectation maximization , 1995, Mach. Learn..
[31] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[32] Martin Tompa,et al. An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem , 1999, ISMB.
[33] Adi Nugroho. Algoritma Dan Struktur Data Dalam Bahasa Java , 2008 .
[34] Robert Sedgewick,et al. Algorithms in C , 1990 .
[35] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.