Algorithms in bioinformatics : Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003 : proceedings

Uloženo v:
Podrobná bibliografie
Korporativní autor: International Workshop on Algorithms in BioInformatics :Budapest, Hungary
Další autoři: Benson, Gary, 1954 (Šéfredaktor, odpovědný redaktor), Page, Roderic D. M., 19..- (Šéfredaktor, odpovědný redaktor)
Médium: Livre numérique
Jazyk:Anglais
Vydáno: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Edice:Lecture notes in computer science. Lecture notes in bioinformatics 2812
Témata:
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithms in bioinformatics, Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, proceedings, Gary Benson, Roderic Page (eds.), Berlin, Springer, 2003, 1 vol. (X-528 p.), Lecture notes in computer science, 3-540-20076-2
• Algorithms in Bioinformatics, Texte imprimé, 9783662194652
LEADER 05256nam a22004217a 4500
001 970130
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN15518508X
020 |a 9783540397632 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a International Workshop on Algorithms in BioInformatics  |n (3  |d  :2003  |c  :Budapest, Hungary). 
245 1 0 |a Algorithms in bioinformatics :  |b Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003 : proceedings   |c [edited by] Gary Benson, Roderic D. M. Page. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science. Lecture notes in bioinformatics  |v 2812  |x 1611-3349  |x 2366-6331 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Comparative Genomics -- A Local Chaining Algorithm and Its Applications in Comparative Genomics -- Common Intervals of Two Sequences -- A Systematic Statistical Analysis of Ion Trap Tandem Mass Spectra in View of Peptide Scoring -- Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity -- Gene Finding and Expression -- A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods -- A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence -- Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency -- Genome Mapping -- New Algorithm for the Simplified Partial Digest Problem -- Noisy Data Make the Partial Digest Problem NP-hard -- Pattern and Motif Discovery -- Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions -- A Combinatorial Approach to Automatic Discovery of Cluster-Patterns -- Dynamic Programming Algorithms for Two Statistical Problems in Computational Biology -- Phylogenetic Analysis -- Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees -- Efficient Generation of Uniform Samples from Phylogenetic Trees -- New Efficient Algorithm for Detection of Horizontal Gene Transfer Events -- Ancestral Maximum Likelihood of Evolutionary Trees Is Hard -- A Linear-Time Majority Tree Algorithm -- Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model -- Better Hill-Climbing Searches for Parsimony -- Computing Refined Buneman Trees in Cubic Time -- Distance Corrections on Recombinant Sequences -- Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks -- Polymorphism -- Identifying Blocks and Sub-populations in Noisy SNP Data -- Designing Optimally Multiplexed SNP Genotyping Assays -- Minimum Recombinant Haplotype Configuration on Tree Pedigrees -- Protein Structure -- Efficient Energy Computation for Monte Carlo Simulation of Proteins -- Speedup LP Approach to Protein Threading via Graph Reduction -- Homology Modeling of Proteins Using Multiple Models and Consensus Sequence Alignment -- Side-Chain Structure Prediction Based on Dead-End Elimination: Single Split DEE-criterion Implementation and Elimination Power -- Sequence Alignment -- A Large Version of the Small Parsimony Problem -- Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree -- Composition Alignment -- String Algorithms -- Match Chaining Algorithms for cDNA Mapping -- Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt -- Bounds for Resequencing by Hybridization -- Selecting Degenerate Multiplex PCR Primers. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
650 |a Modèles mathématiques 
650 |a Informatique 
650 |a Bioinformatique 
650 |a Algorithmes 
650 |a Biologie moléculaire 
650 |a Structures de données (informatique) 
650 |a Actes de congrès 
700 1 |a Benson, Gary,  |d 1954.  |4 pbd 
700 1 |a Page, Roderic D. M.,  |d 19..-  |4 pbd 
776 0 |0 075228459  |t Algorithms in bioinformatics  |o Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003  |o proceedings  |f Gary Benson, Roderic Page (eds.)  |c Berlin  |n Springer  |d 2003  |p 1 vol. (X-528 p.)  |s Lecture notes in computer science  |z 3-540-20076-2 
776 0 |t Algorithms in Bioinformatics  |b Texte imprimé  |z 9783662194652 
856 4 |q PDF  |u https://doi.org/10.1007/b13243  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5SRQFP2G-C  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750666501  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b13243  |z Accès Université d'Orléans 
856 4 |5 180339901:754015661  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b13243  |z Accès INSA CVL 
997 |0 970130  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/