Algorithms in bioinformatics : 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004 : proceedings

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: Workshop on algorithms in bioinformatics :Bergen, NO
Weitere Verfasser: Jonassen, Inge (Verlagsleitung), Kim, Junhyong (Verlagsleitung)
Format: Livre numérique
Sprache:Anglais
Veröffentlicht: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Schriftenreihe:Lecture notes in computer science. Lecture notes in bioinformatics 3240
Schlagworte:
Online Zugang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Anmerkung: 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, 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, proceedings, Inge Jonassen, Junhyong Kim (eds.), Berlin, Springer, 2004, 1 vol. (IX-476 p.), Lecture notes in computer science, 3-540-23018-1
• Algorithms in Bioinformatics, Texte imprimé, 9783662207420
LEADER 05248nam a22004337a 4500
001 971579
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155209361
020 |a 9783540302193 (PDF) 
041 0 |a eng 
082 |a 572.80285 
082 |a 004 
111 2 |a Workshop on algorithms in bioinformatics  |n (4  |d  :2004  |c  :Bergen, NO). 
245 1 0 |a Algorithms in bioinformatics :  |b 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004 : proceedings   |c [edited by] Inge Jonassen, Junhyong Kim. 
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 3240  |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 Papers -- Reversing Gene Erosion Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data -- Reconstructing Ancestral Gene Orders Using Conserved Intervals -- Sorting by Reversals with Common Intervals -- A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns -- A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals -- Algorithms for Finding Maximal-Scoring Segment Sets -- Gapped Local Similarity Search with Provable Guarantees -- Monotone Scoring of Patterns with Mismatches -- Suboptimal Local Alignments Across Multiple Scoring Schemes -- A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic -- Adding Hidden Nodes to Gene Networks -- Joint Analysis of DNA Copy Numbers and Gene Expression Levels -- Searching for Regulatory Elements of Alternative Splicing Events Using Phylogenetic Footprinting -- Supervised Learning-Aided Optimization of Expert-Driven Functional Protein Sequence Annotation -- Multiple Vector Seeds for Protein Alignment -- Solving the Protein Threading Problem by Lagrangian Relaxation -- Protein-Protein Interfaces: Recognition of Similar Spatial and Chemical Organizations -- ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences -- Local Search Heuristic for Rigid Protein Docking -- Sequence Database Compression for Peptide Identification from Tandem Mass Spectra -- Linear Reduction for Haplotype Inference -- A New Integer Programming Formulation for the Pure Parsimony Problem in Haplotype Analysis -- Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction -- Approximation Algorithms for the Selection of Robust Tag SNPs -- The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach -- A Faster and More Space-EfficientAlgorithm for Inferring Arc-Annotations of RNA Sequences Through Alignment -- New Algorithms for Multiple DNA Sequence Alignment -- Chaining Algorithms for Alignment of Draft Sequence -- Translation Initiation Sites Prediction with Mixture Gaussian Models -- Online Consensus and Agreement of Phylogenetic Trees -- Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity -- Topological Rearrangements and Local Search Method for Tandem Duplication Trees -- Phylogenetic Super-networks from Partial Trees -- Genome Identification and Classification by Short Oligo Arrays -- Novel Tree Edit Operations for RNA Secondary Structure Comparison -- The Most Probable Labeling Problem in HMMs and Its Application to Bioinformatics -- Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding -- Finding Optimal Pairs of Patterns -- Finding Missing Patterns. 
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 Jonassen, Inge.  |4 pbd 
700 1 |a Kim, Junhyong.  |4 pbd 
776 0 |0 083255168  |t Algorithms in bioinformatics  |o 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004  |o proceedings  |f Inge Jonassen, Junhyong Kim (eds.)  |c Berlin  |n Springer  |d 2004  |p 1 vol. (IX-476 p.)  |s Lecture notes in computer science  |z 3-540-23018-1 
776 0 |t Algorithms in Bioinformatics  |b Texte imprimé  |z 9783662207420 
856 4 |q PDF  |u https://doi.org/10.1007/b100405  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-2GWH17QL-6  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750650966  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b100405  |z Accès Université d'Orléans 
856 4 |5 180339901:754001423  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b100405  |z Accès INSA CVL 
997 |0 971579  |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/