Algorithms in Bioinformatics: 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3240
Editat de Inge Jonassen, Junhyong Kimen Limba Engleză Paperback – 7 sep 2004
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 321.96 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 315.78 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.19 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 625.15 lei
Preț vechi: 735.47 lei
-15% Nou
Puncte Express: 938
Preț estimativ în valută:
119.65€ • 125.80$ • 99.52£
119.65€ • 125.80$ • 99.52£
Carte tipărită la comandă
Livrare economică 27 decembrie 24 - 10 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540230182
ISBN-10: 3540230181
Pagini: 488
Ilustrații: IX, 477 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.68 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Bioinformatics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540230181
Pagini: 488
Ilustrații: IX, 477 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.68 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Bioinformatics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.