Algorithms for Computational Biology: 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings

Algorithms for Computational Biology: 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings

Algorithms for Computational Biology: 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings

Algorithms for Computational Biology: 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings

eBook1st ed. 2019 (1st ed. 2019)

$48.99  $64.99 Save 25% Current price is $48.99, Original price is $64.99. You Save 25%.

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

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.


Product Details

ISBN-13: 9783030181741
Publisher: Springer-Verlag New York, LLC
Publication date: 05/21/2019
Series: Lecture Notes in Computer Science , #11488
Sold by: Barnes & Noble
Format: eBook
File size: 14 MB
Note: This product may take a few minutes to download.

Table of Contents

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.

From the B&N Reads Blog

Customer Reviews