Algorithms in Bioinformatics 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Jonassen, Inge (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Kim, Junhyong (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Έκδοση:1st ed. 2004.
Σειρά:Lecture Notes in Bioinformatics ; 3240
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05329nam a2200601 4500
001 978-3-540-30219-3
003 DE-He213
005 20191022071338.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 |a 9783540302193  |9 978-3-540-30219-3 
024 7 |a 10.1007/b100405  |2 doi 
040 |d GrThAP 
050 4 |a QH345 
050 4 |a QD415-436 
072 7 |a PSB  |2 bicssc 
072 7 |a SCI007000  |2 bisacsh 
072 7 |a PSB  |2 thema 
082 0 4 |a 572  |2 23 
245 1 0 |a Algorithms in Bioinformatics  |h [electronic resource] :  |b 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings /  |c edited by Inge Jonassen, Junhyong Kim. 
250 |a 1st ed. 2004. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2004. 
300 |a IX, 477 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Bioinformatics ;  |v 3240 
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-Efficient Algorithm 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. 
650 0 |a Biochemistry. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Computers. 
650 0 |a Data structures (Computer science). 
650 0 |a Computer science-Mathematics. 
650 1 4 |a Biochemistry, general.  |0 http://scigraph.springernature.com/things/product-market-codes/L14005 
650 2 4 |a Programming Techniques.  |0 http://scigraph.springernature.com/things/product-market-codes/I14010 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Computation by Abstract Devices.  |0 http://scigraph.springernature.com/things/product-market-codes/I16013 
650 2 4 |a Data Structures.  |0 http://scigraph.springernature.com/things/product-market-codes/I15017 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
700 1 |a Jonassen, Inge.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Kim, Junhyong.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662207420 
776 0 8 |i Printed edition:  |z 9783540230182 
830 0 |a Lecture Notes in Bioinformatics ;  |v 3240 
856 4 0 |u https://doi.org/10.1007/b100405  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)