Algorithms for Computational Biology: Lecture Notes in Computer Science, cartea 8542
Editat de Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Trutheen Limba Engleză Paperback – 5 aug 2014
The 20 revised full papers were carefully reviewed and selected from 39 submissions. The scope of AlCoB includes topics of either theoretical or applied interest, namely: exact sequence analysis, approximate sequence analysis, pairwise sequence alignment, multiple sequence alignment, sequence assembly, genome rearrangement, regulatory motif finding, phylogeny reconstruction, phylogeny comparison, structure prediction, proteomics: molecular pathways, interaction networks, transcriptomics: splicing variants, isoform inference and quantification, differential analysis, next-generation sequencing: population genomics, metagenomics, metatranscriptomics, microbiome analysis, systems biology.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei - 20%
Preț: 791.54 lei - 20%
Preț: 633.70 lei - 20%
Preț: 984.64 lei - 20%
Preț: 782.57 lei - 20%
Preț: 558.53 lei - 20%
Preț: 562.49 lei - 20%
Preț: 487.46 lei - 20%
Preț: 400.77 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 556.96 lei - 20%
Preț: 560.93 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 1079.23 lei - 15%
Preț: 672.87 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 478.59 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 620.33 lei - 20%
Preț: 731.97 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 560.93 lei - 20%
Preț: 735.28 lei - 20%
Preț: 748.63 lei - 20%
Preț: 560.11 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 850.42 lei - 20%
Preț: 679.09 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 631.96 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei - 20%
Preț: 403.00 lei
Preț: 375.74 lei
Puncte Express: 564
Preț estimativ în valută:
66.44€ • 76.19$ • 57.42£
66.44€ • 76.19$ • 57.42£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783319079523
ISBN-10: 3319079522
Pagini: 292
Ilustrații: XIV, 275 p. 76 illus.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2014
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3319079522
Pagini: 292
Ilustrații: XIV, 275 p. 76 illus.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2014
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
Comparative Genomics Approaches to Identifying Functionally Related Genes.- A Greedy Algorithm for Hierarchical Complete Linkage Clustering.- Vester’s Sensitivity Model for Genetic Networks with Time-Discrete Dynamics.- Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem.- Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations.- On Low Treewidth Graphs and Supertrees.- On Optimal Read Trimming in Next Generation Sequencing and Its Complexity.- On the Implementation of Quantitative Model Refinement.- HapMonster: A Statistically Unified Approach for Variant Calling and Haplotyping Based on Phase-Informative Reads.- Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads.- Modeling the Geometry of the Endoplasmic Reticulum Network.- On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions.- On the Diameter of Rearrangement Problems.- Efficiently Enumerating All Connected InducedSubgraphs of a Large Molecular Network.- On Algorithmic Complexity of Biomolecular Sequence Assembly Problem.- A Closed-Form Solution for Transcription Factor Activity Estimation Using Network Component Analysis.- SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on Breakpoints.- Analysis and Classification of Constrained DNA Elements with N-gram Graphs and Genomic Signatures.- Inference of Boolean Networks from Gene Interaction Graphs Using a SAT Solver.- RRCA: Ultra-Fast Multiple In-species Genome Alignments.- Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric.