Algorithms for Computational Biology
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.
Preț: 374.58 lei
Nou
Puncte Express: 562
Preț estimativ în valută:
66.27€ • 77.33$ • 57.94£
66.27€ • 77.33$ • 57.94£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
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
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
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.