LEADER 01459nam0 2200313 i 450 001 SUN0019187 005 20170627112811.184 010 $a35-406-3369-3$d0.00 010 $a8-3-540-63369-3 100 $a20061105d1999 |0engc50 ba 101 $aeng 102 $aDE 105 $a|||| ||||| 200 1 $aˆA ‰history of algorithms$efrom the pebble to the microchip$fJean-Luc Chabert (ed.)$gauthors: Evelyne Barbin ... [et al.]$gfor arab mathematics: Ahmed Djebbar; for chinese mathematics: Jean-Claude Martzloff; translator of the english edition: Chris Weeks 205 $aBerlin : Springer$b1999 210 $aIX$d524 p. ; 24 cm 215 $aIndicazione degli autori dal verso del front. 454 1$1001SUN0079562$12001 $aHistoire d'algorithmes$edu caillou a la puce.$91401067 606 $a01Axx$xHistory of mathematics and mathematicians [MSC 2020]$2MF$3SUNC019751 620 $dBerlin$3SUNL000066 702 1$aChabert$b, Jean-Luc$3SUNV043739 702 1$aBarbin$b, Evelyne$3SUNV043740 712 $aSpringer$3SUNV000178$4650 801 $aIT$bSOL$c20200921$gRICA 856 4 $u/sebina/repository/catalogazione/documenti/Chabert - A History of Algorithms.pdf$zContents 912 $aSUN0019187 950 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST 01-XX 0759 $e08 5642 I 20061105 996 $aHistoire d'algorithmes$91401067 997 $aUNICAMPANIA LEADER 06523nam 22006975 450 001 996465723603316 005 20200702234308.0 010 $a3-319-56970-8 024 7 $a10.1007/978-3-319-56970-3 035 $a(CKB)3850000000027396 035 $a(DE-He213)978-3-319-56970-3 035 $a(MiAaPQ)EBC6299351 035 $a(MiAaPQ)EBC5579805 035 $a(Au-PeEL)EBL5579805 035 $a(OCoLC)982931659 035 $a(PPN)200512536 035 $a(EXLCZ)993850000000027396 100 $a20170411d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aResearch in Computational Molecular Biology$b[electronic resource] $e21st Annual International Conference, RECOMB 2017, Hong Kong, China, May 3-7, 2017, Proceedings /$fedited by S. Cenk Sahinalp 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIV, 406 p. 104 illus.) 225 1 $aLecture Notes in Bioinformatics ;$v10229 311 $a3-319-56969-4 327 $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. . 330 $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. 410 0$aLecture Notes in Bioinformatics ;$v10229 606 $aBioinformatics 606 $aBiomathematics 606 $aArtificial intelligence 606 $aOptical data processing 606 $aDatabase management 606 $aComputational Biology/Bioinformatics$3https://scigraph.springernature.com/ontologies/product-market-codes/I23050 606 $aMathematical and Computational Biology$3https://scigraph.springernature.com/ontologies/product-market-codes/M31000 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aImage Processing and Computer Vision$3https://scigraph.springernature.com/ontologies/product-market-codes/I22021 606 $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024 615 0$aBioinformatics. 615 0$aBiomathematics. 615 0$aArtificial intelligence. 615 0$aOptical data processing. 615 0$aDatabase management. 615 14$aComputational Biology/Bioinformatics. 615 24$aMathematical and Computational Biology. 615 24$aArtificial Intelligence. 615 24$aImage Processing and Computer Vision. 615 24$aDatabase Management. 676 $a572.80113 702 $aSahinalp$b S. Cenk$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465723603316 996 $aResearch in Computational Molecular Biology$9772065 997 $aUNISA