Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms for Computational Biology de Ian Holmes

Algorithms for Computational Biology: Lecture Notes in Computer Science, cartea 11488

Editat de Ian Holmes, Carlos Martín-Vide, Miguel A. Vega-Rodríguez
en Limba Engleză Paperback – 13 apr 2019
This book constitutes the proceedings of the 6th InternationalConference on Algorithms for Computational Biology, AlCoB 2019, held in Berkeley, CA, USA, in May 2019.
The 15 full papers presented together with 1 invited paper were carefully reviewed and selected from 30 submissions. They are organized in the following topical sections: Biological networks and graph algorithms; genome rearrangement, assembly and classification; sequence analysis, phylogenetics and other biological processes.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 43687 lei

Puncte Express: 655
Preț estimativ în valută:
7719€ • 8889$ • 6682£

Carte tipărită la comandă

Livrare economică 12-26 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030181734
ISBN-10: 3030181731
Pagini: 244
Ilustrații: XVI, 225 p. 66 illus., 35 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:1st ed. 2019
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Invited Talk.- New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation.- Biological Networks and Graph Algorithms.- New Polynomial-Time Algorithm around the Scaffolding Problem.- Enumerating Dominant Pathways in Biological Networks by Information Flow Analysis.- Comparing Different Graphlet Measures for Evaluating Network Model Fits to BioGRID PPI Networks.- Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots.- PathRacer: Racing Profile HMM Paths on Assembly Graph.- Genome Rearrangement, Assembly and Classification.- A Uniform Theory of Adequate Subgraphs for the Genome Median, Halving, and Aliquoting Problems.- Lightweight Metagenomic Classification via eBWT.- MULKSG: MULtiple K Simultaneous Graph Assembly.- Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance.- Generalizations of the Genomic Rank Distance to Indels.- Sequence Analysis, Phylogenetics and Other Biological Processes.- Using INC within Divide-and-Conquer Phylogeny Estimation.- Predicting Methylation from Sequence and Gene Expression Using Deep Learning with Attention.- A Mathematical Model for Enhancer Activation Kinetics During Cell Differentiation.- Transcript Abundance Estimation and the Laminar Packing Problem.- Efficient Algorithms for Finding Edit-Distance Based Motifs.