000 06406nam a22006135i 4500
001 978-3-319-56970-3
003 DE-He213
005 20210120143257.0
007 cr nn 008mamaa
008 170411s2017 gw | s |||| 0|eng d
020 _a9783319569703
_9978-3-319-56970-3
024 7 _a10.1007/978-3-319-56970-3
_2doi
050 4 _aQH324.2-324.25
072 7 _aPSA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aPSA
_2thema
072 7 _aUB
_2thema
082 0 4 _a570.285
_223
245 1 0 _aResearch in Computational Molecular Biology
_h[electronic resource] :
_b21st Annual International Conference, RECOMB 2017, Hong Kong, China, May 3-7, 2017, Proceedings /
_cedited by S. Cenk Sahinalp.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXIV, 406 p. 104 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Bioinformatics ;
_v10229
_aLecture Notes in Computer Science
_v10229
505 0 _aBoosting alignment accuracy by adaptive local realignment -- A concurrent subtractive assembly approach for identification of disease associated sub-meta-genomes -- A flow procedure for the linearization of genome variation graphs -- Dynamic alignment-free and reference-free read compression -- A fast approximate algorithm for mapping long reads to large reference databases -- Determining the consistency of resolved triplets and fan triplets -- Progressive calibration and averaging for tandem mass spectrometry statistical confidence estimation: Why settle for a single decoy -- Resolving multi-copy duplications de novo using polyploid phasing -- A Bayesian active learning experimental design for inferring signaling networks -- BBK* (Branch and Bound over K*): A provable and efficient ensemble-based algorithm to optimize stability and binding affinity over large sequence spaces -- Super-bubbles, ultra-bubbles and cacti -- EPR-dictionaries: A practical and fast data structure for constant time searches in unidirectional and bidirectional FM indices -- A Bayesian framework for estimating cell type composition from DNA methylation without the need for methylation reference -- Towards recovering Allele-specific cancer genome graphs -- Using stochastic approximation techniques to efficiently construct confidence intervals for heritability -- Improved search of large transcriptomic sequencing databases using split sequence bloom trees -- All some sequence bloom trees -- Longitudinal genotype-phenotype association study via temporal structure auto-learning predictive model -- Improving imputation accuracy by inferring causal variants in genetic studies -- The copy-number tree mixture deconvolution problem and applications to multi-sample bulk sequencing tumor data -- Quantifying the impact of non-coding variants on transcription factor-DNA binding -- aBayesQR: A Bayesian method for reconstruction of viral populations characterized by low diversity -- BeWith: A between-within method for module discovery in cancer using integrated analysis of mutual exclusivity, co-occurrence and functional interactions -- K-mer Set Memory (KSM) motif representation enables accurate prediction of the impact of regulatory variants -- Network-based coverage of mutational profiles reveals cancer genes -- Ultra-accurate complex disorder prediction: case study of neurodevelopmental disorders -- Inference of the human polyadenylation Code -- Folding membrane proteins by deep transfer learning -- A network integration approach for drug-target interaction prediction and computational drug repositioning from heterogeneous information -- Epistasis in genomic and survival data of cancer patients -- Ultra-fast identity by descent detection in biobank-scale cohorts using positional burrows-wheeler transform -- Joker de Bruijn: sequence libraries to cover all k-mers using joker characters -- GATTACA: Lightweight metagenomic binning using kmer counting -- Species tree estimation using ASTRAL: how many genes are enough -- Reconstructing antibody repertoires from error-prone immune-sequencing datasets -- NetREX: Network rewiring using EXpression - Towards context specific regulatory networks -- E pluribus unum: United States of single cells -- ROSE: a deep learning based framework for predicting ribosome stalling. .
520 _aThis book constitutes the proceedings of the 21th Annual Conference on Research in Computational Molecular Biology, RECOMB 2017, held in Hong Kong, China, in May 2017. The 22 regular papers presented in this volume were carefully reviewed and selected from 184 submissions. 16 short abstracts are included in the back matter of the volume. They report on original research in all areas of computational molecular biology and bioinformatics.
650 0 _aBioinformatics.
650 0 _aBiomathematics.
650 0 _aArtificial intelligence.
650 0 _aOptical data processing.
650 0 _aDatabase management.
650 1 4 _aComputational Biology/Bioinformatics.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I23050
650 2 4 _aMathematical and Computational Biology.
_0https://scigraph.springernature.com/ontologies/product-market-codes/M31000
650 2 4 _aArtificial Intelligence.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I21000
650 2 4 _aImage Processing and Computer Vision.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I22021
650 2 4 _aDatabase Management.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I18024
700 1 _aSahinalp, S. Cenk.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319569697
776 0 8 _iPrinted edition:
_z9783319569710
830 0 _aLecture Notes in Bioinformatics ;
_v10229
830 0 _aLecture Notes in Computer Science ;
_v10229
856 4 0 _uhttps://doi.org/10.1007/978-3-319-56970-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c56969
_d56969