Algorithms for Computational Biology: Lecture Notes in Computer Science, cartea 12715
Editat de Carlos Martín-Vide, Miguel A. Vega-Rodríguez, Travis Wheeleren Limba Engleză Paperback – 17 apr 2021
The 12 full papers included in this volume were carefully reviewed and selected from 22 submissions. They were organized in topical sections on genomics, phylogenetics, and RNA-Seq and other biological processes. The scope of AlCoB includes topics of either theoretical or applied interest, namely: sequence analysis; sequence alignment; sequence assembly; genome rearrangement; regulatory motif finding; phylogeny reconstruction; phylogeny comparison; structure prediction; compressive genomics; proteomics: molecular pathways, interaction networks, mass spectrometry analysis; transcriptomics: splicing variants, isoform inference and quantification, differential analysis; next-generation sequencing: population genomics, metagenomics, metatranscriptomics, epigenomics; genome CD architecture; microbiome analysis; cancer computational biology; and systems biology.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 316.23 lei 43-57 zile | |
| Springer – 17 apr 2021 | 316.23 lei 43-57 zile | |
| Springer – 20 feb 2020 | 371.43 lei 43-57 zile |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 733.68 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 449.81 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 850.42 lei - 20%
Preț: 386.08 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 620.33 lei - 20%
Preț: 620.33 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 435.28 lei - 20%
Preț: 748.63 lei - 20%
Preț: 633.70 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 675.83 lei - 20%
Preț: 678.21 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 560.93 lei - 20%
Preț: 556.96 lei - 20%
Preț: 313.10 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 15%
Preț: 558.12 lei - 20%
Preț: 563.29 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 20%
Preț: 562.49 lei - 15%
Preț: 672.87 lei - 20%
Preț: 571.88 lei - 20%
Preț: 478.59 lei - 20%
Preț: 984.64 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei - 20%
Preț: 313.87 lei - 20%
Preț: 314.86 lei - 20%
Preț: 793.92 lei - 18%
Preț: 945.44 lei
Preț: 316.23 lei
Preț vechi: 395.28 lei
-20%
Puncte Express: 474
Preț estimativ în valută:
55.92€ • 64.12$ • 48.33£
55.92€ • 64.12$ • 48.33£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783030744311
ISBN-10: 3030744310
Pagini: 184
Ilustrații: X, 173 p. 50 illus., 29 illus. in color.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.29 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030744310
Pagini: 184
Ilustrații: X, 173 p. 50 illus., 29 illus. in color.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.29 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars.- Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning.- Exploiting Variable Sparsity in Computing Equilibria of Biological Dynamical Systems by Triangular Decomposition.- A Recovery Algorithm and Pooling Designs for One-Stage Noisy Group Testing Under the Probabilistic Framework.- Novel Phylogenetic Network Distances Based on Cherry Picking.- Best Match Graphs with Binary Trees.- Scalable and Accurate Phylogenetic Placement Using pplacer-XR.- Comparing Methods for Species Tree Estimation with Gene Duplication and Loss.- Reversal Distance on Genomes with Different Gene Content and Intergenic Regions Information.- Reversals Distance Considering Flexible Intergenic Regions Sizes.- Improved DNA-versus-Protein Homology Search for Protein Fossils.- The Maximum Weight Trace Alignment Merging Problem.