登入選單
返回Google圖書搜尋
Algorithms in Bioinformatics
Olivier Gascuel
其他書名
First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings
出版Springer Science & Business Media, 2001-08-15
主題Computers / Artificial Intelligence / GeneralComputers / Computer ScienceComputers / Data Science / GeneralComputers / Database Administration & ManagementComputers / Information TheoryComputers / Information TechnologyComputers / Machine TheoryComputers / Programming / GeneralComputers / Programming / AlgorithmsComputers / Data Science / Data Modeling & DesignComputers / User InterfacesComputers / Data Science / BioinformaticsComputers / Computerized Home & EntertainmentLanguage Arts & Disciplines / Library & Information Science / GeneralMathematics / Discrete MathematicsMathematics / CombinatoricsScience / Life Sciences / GeneralScience / Bioinformatics
ISBN35404251609783540425168
URLhttp://books.google.com.hk/books?id=mlWetGR0glQC&hl=&source=gbs_api
EBookSAMPLE
註釋An improved model for statistical alignment (I. Miklós, Z. Toroczkai). Improving profile-profile alignments via log average scoring (N. von ohsen, R. Zimmer). False positive s in genomic map assembly and sequence validation (T. Anantharaman, B. Mishra). Boosting EM for radiation hybrid and genetic mapping (T. Schiex, P. Chabrier, M. Bouchez, D. Milan). Placing probes along the genome using pairwise distance data (W. Casey, B. Mishra, M. Wigler). Comparing a Hidden Markov model and a stochastic context-free grammar (A. Jagota, R. B. Lyngso, C. N. S. Pedersen). Assessing the statistical significance of overrepresented oligonucleotides (A. Denise, M. Régnier, M. vandenbogaert). Pattern matching and pattern discovery algorithms for protein topologies (J. Viksna, D. Gilbert). Computing linking numbers of a filtration (H. Edelsbrusnner, A. Zomorodian). Side chain-positioning as an integer programming problem (O. Eriksson, Y. Zhou, A. Elofsson). A chemical-distance-based test for positive darwinian selection (T. Pupko, R. Sharan, M. Hasegawa, R. Shamir, D. Graur). Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynominal time (G. Ganapathysaravanabavan, T. Warnow). Experiments in computing sequences of reversals (A. Bergeron, François Strasbourg). Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes (Li-San Wang). Finding an optimal inversion median: experimental results (A. C. Siepel, B. M. E. Moret). Analytic solutions for three-taxon MLMC trees with variable rates across sites (B. Chor, M. Hendy, D. Penny). The performance of phylogenetic methods on trees of bounded diameter (L. nakhleh, U. Roshan, K. St. John, J. Sun, T. Warnow). (1+E)- approximation of sorting by reversals and transpositions (N. Eriksen). On the practical solution of the reversal median problem (A. Caprara). Algorithms for finding gene clusters (S. Heber, J. Stoye). Determination of binding amino acids based on random peptide array screening data (P. J. van der Veen, L. F. A. Wessels, J. W. Sloostra, R. H. Meloen, M. J. T. Reinders, J. Hellendoorn). A simple hyper-geometric approach for discovering putative transcription factor binding sites (Y. Barash, G. Bejerano, N. Friedman). Comparing assemblies using fragments and mate-pairs (D. H. Huson, A. L. Halpern, Z. Lai, E. W. myers, K. Reinert, G. G. Sutton). Author index.