عنوان
پدید آورنده
موضوع
رده
QH324.2 .A43 2019eb
QH324
.
2
.
A43
2019eb
کتابخانه
محل استقرار
INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
3030181731
(Number (ISBN
303018174X
(Number (ISBN
3030181758
(Number (ISBN
9783030181734
(Number (ISBN
9783030181741
(Number (ISBN
9783030181758
Erroneous ISBN
9783030181734
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
Algorithms for computational biology :
General Material Designation
[Book]
Other Title Information
6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings /
First Statement of Responsibility
Ian Holmes, Carlos Martín-Vide, Miguel A. Vega-Rodríguez, editors.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Cham :
Name of Publisher, Distributor, etc.
Springer,
Date of Publication, Distribution, etc.
2019.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (xvi, 225 pages) :
Other Physical Details
illustrations (some color)
SERIES
Series Title
Lecture notes in bioinformatics
Series Title
Lecture notes in computer science ;
Series Title
LNCS sublibrary. SL 8, Bioinformatics
Volume Designation
11488
GENERAL NOTES
Text of Note
International conference proceedings.
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references and author index.
CONTENTS NOTE
Text of Note
Intro; Preface; Organization; Abstracts of Invited Talks; Exploring Phenotypic Heterogeneity Across Tissues and Conditions with Network-Based Approaches; New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation#x8E;1#x90;; Contents; Invited Talk; New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation; 1 Introduction; 2 Phylogeny Estimation; 2.1 Gene Tree Estimation; 2.2 Species Tree Estimation; 2.3 Divide-and-Conquer Strategies; 3 Disjoint Tree Merger; 3.1 The DTM Problem; 3.2 NJMerge; 3.3 Constrained INC; 4 Pipelines Using DTM Methods; 4.1 Overview
Text of Note
2.1 Network Implementation2.2 Network Simulation; 3 A Case Study: Escherichia coli Transcription Network; 4 Discussion; References; Comparing Different Graphlet Measures for Evaluating Network Model Fits to BioGRID PPI Networks; 1 Introduction; 1.1 Graphlets; 1.2 Graphlet-Based Network Comparison Measures; 1.3 Models; 1.4 Comparing Models to Data; 1.5 Our Contribution; 2 Methods; 3 Results; 3.1 Assessing Quality of Each Measure; 3.2 Assessment of Fits to PPIs by Graphlet-Based Measures; 3.3 Mixed Agreement Across Measures; 4 Fit of PPI Networks from the 2018 Update of the IID Database
Text of Note
2.4 Dynamic Programming Algorithm for Best Path Extraction2.5 From Top(1) to Top(k); 2.6 Collapsing Event Graph; 2.7 Alignment Algorithm: Collapsed Event Graph Construction; 2.8 Implementation and Heuristics; 3 Results; 3.1 23S Search in E. coli str. K12 Assembly; 3.2 16S Components of SYNTH Mock Metagenome Dataset; 3.3 Urban Wastewater Metagenome; 3.4 PathRacer and MegaGTA Running Time and Memory Consumption; 4 Conclusion; References; Genome Rearrangement, Assembly and Classification; A Uniform Theory of Adequate Subgraphs for the Genome Median, Halving, and Aliquoting Problems
Text of Note
4.2 Theoretical Guarantees4.3 Empirical Results; 4.4 Discussion; 5 Conclusions; References; Biological Networks and Graph Algorithms; New Polynomial-Time Algorithm Around the Scaffolding Problem; 1 Introduction; 2 Notation and Problem Description; 3 Feasibility; 3.1 Feasability Function; 4 Approximation Result; 4.1 Notations and Definitions; 4.2 Optimization; 4.3 Algorithm; 5 Conclusion; A Appendix; A.1 Algorithms; References; Enumerating Dominant Pathways in Biological Networks by Information Flow Analysis; 1 Introduction; 2 Information Flow in Biological Networks
Text of Note
5 Discussion and ConclusionReferences; Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots; 1 Introduction; 2 Background; 2.1 Biological and Topological Definitions; 2.2 Graph Partitioning Algorithm; 3 Classification of Pseudoknots as Either Recursive or Non-recursive and Identification of Each Recursive Region; 4 Conclusions and Ongoing Work; References; PathRacer: Racing Profile HMM Paths on Assembly Graph; 1 Introduction; 2 Methods; 2.1 General Definitions; 2.2 Event Graph; 2.3 Top(1) Path Problem via Event Graph
0
8
8
8
8
SUMMARY OR ABSTRACT
Text of Note
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.
ACQUISITION INFORMATION NOTE
Source for Acquisition/Subscription Address
Springer Nature
Stock Number
com.springer.onix.9783030181741
OTHER EDITION IN ANOTHER MEDIUM
International Standard Book Number
9783030181734
International Standard Book Number
9783030181758
PARALLEL TITLE PROPER
Parallel Title
AICoB 2019
TOPICAL NAME USED AS SUBJECT
Computational biology, Congresses.
Computational biology.
(SUBJECT CATEGORY (Provisional
COM014000
PSA
PSA
UB
DEWEY DECIMAL CLASSIFICATION
Number
570
.
285
Edition
23
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QH324
.
2
Book number
.
A43
2019eb
PERSONAL NAME - ALTERNATIVE RESPONSIBILITY
Holmes, Ian, (College teacher)
Martín Vide, Carlos
Vega-Rodríguez, Miguel A.
CORPORATE BODY NAME - PRIMARY RESPONSIBILITY
InternationalConference on Algorithms for Computational Biology(6th :2019 :, Berkeley, Calif.)
ORIGINATING SOURCE
Date of Transaction
20200823090106.0
Cataloguing Rules (Descriptive Conventions))
pn
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب [Book]
Y
