Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms in Bioinformatics [[electronic resource] ] : 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010, Proceedings / / edited by Vincent Moulton, Mona Singh
| Algorithms in Bioinformatics [[electronic resource] ] : 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010, Proceedings / / edited by Vincent Moulton, Mona Singh |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 376 p. 94 illus.) |
| Disciplina | 570 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Life sciences
Algorithms Computers Artificial intelligence Database management Bioinformatics Life Sciences, general Algorithm Analysis and Problem Complexity Computation by Abstract Devices Artificial Intelligence Database Management Computational Biology/Bioinformatics |
| Soggetto genere / forma | Kongress |
| ISBN |
1-280-38845-5
9786613566379 3-642-15294-5 |
| Classificazione | 570 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Biomolecular Structure: RNA, Protein and Molecular Comparison -- A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea -- Sparse Estimation for Structural Variability -- Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors -- Sparsification of RNA Structure Prediction Including Pseudoknots -- Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs -- Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant’s Approach -- Comparative Genomics -- Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss -- Genomic Distance with DCJ and Indels -- Listing All Sorting Reversals in Quadratic Time -- Haplotype and Genotype Analysis -- Discovering Kinship through Small Subsets -- Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites -- Haplotypes versus Genotypes on Pedigrees -- Haplotype Inference on Pedigrees with Recombinations and Mutations -- High-throughput Data Analysis: Next Generation Sequencing and Flow Cytometry -- Identifying Rare Cell Populations in Comparative Flow Cytometry -- Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA -- Design of an Efficient Out-of-Core Read Alignment Algorithm -- Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data -- Networks -- Improved Orientations of Physical Networks -- Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms -- Efficient Subgraph Frequency Estimation with G-Tries -- Phylogenetics -- Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution -- The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree -- Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data -- An Experimental Study of Quartets MaxCut and Other Supertree Methods -- An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation -- Sequences, Strings and Motifs -- Effective Algorithms for Fusion Gene Detection -- Swiftly Computing Center Strings -- Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size -- Pair HMM Based Gap Statistics for Re-evaluation of Indels in Alignments with Affine Gap Penalties -- Quantifying the Strength of Natural Selection of a Motif Sequence. |
| Record Nr. | UNISA-996465681603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms in bioinformatics : 10th international workshop, WABI 2010, Liverpool, UK, September 6-8, 2010 : proceedings / / Vincent Moulton, Mona Singh (eds.)
| Algorithms in bioinformatics : 10th international workshop, WABI 2010, Liverpool, UK, September 6-8, 2010 : proceedings / / Vincent Moulton, Mona Singh (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XII, 376 p. 94 illus.) |
| Disciplina | 570.285 |
| Altri autori (Persone) |
MoultonVincent
SinghMona |
| Collana |
Lecture notes in computer science
Lecture notes in bioinformatics |
| Soggetto topico |
Bioinformatics
Computer algorithms |
| ISBN |
1-280-38845-5
9786613566379 3-642-15294-5 |
| Classificazione | 570 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Biomolecular Structure: RNA, Protein and Molecular Comparison -- A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea -- Sparse Estimation for Structural Variability -- Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors -- Sparsification of RNA Structure Prediction Including Pseudoknots -- Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs -- Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant’s Approach -- Comparative Genomics -- Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss -- Genomic Distance with DCJ and Indels -- Listing All Sorting Reversals in Quadratic Time -- Haplotype and Genotype Analysis -- Discovering Kinship through Small Subsets -- Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites -- Haplotypes versus Genotypes on Pedigrees -- Haplotype Inference on Pedigrees with Recombinations and Mutations -- High-throughput Data Analysis: Next Generation Sequencing and Flow Cytometry -- Identifying Rare Cell Populations in Comparative Flow Cytometry -- Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA -- Design of an Efficient Out-of-Core Read Alignment Algorithm -- Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data -- Networks -- Improved Orientations of Physical Networks -- Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms -- Efficient Subgraph Frequency Estimation with G-Tries -- Phylogenetics -- Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution -- The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree -- Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data -- An Experimental Study of Quartets MaxCut and Other Supertree Methods -- An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation -- Sequences, Strings and Motifs -- Effective Algorithms for Fusion Gene Detection -- Swiftly Computing Center Strings -- Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size -- Pair HMM Based Gap Statistics for Re-evaluation of Indels in Alignments with Affine Gap Penalties -- Quantifying the Strength of Natural Selection of a Motif Sequence. |
| Record Nr. | UNINA-9910484023403321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Research in Computational Molecular Biology [[electronic resource] ] : 20th Annual Conference, RECOMB 2016, Santa Monica, CA, USA, April 17-21, 2016, Proceedings / / edited by Mona Singh
| Research in Computational Molecular Biology [[electronic resource] ] : 20th Annual Conference, RECOMB 2016, Santa Monica, CA, USA, April 17-21, 2016, Proceedings / / edited by Mona Singh |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXXIV, 274 p. 64 illus., 41 illus. in color.) |
| Disciplina | 570.285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Biomathematics Algorithms Data mining Data structures (Computer science) Computational Biology/Bioinformatics Mathematical and Computational Biology Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery Data Structures |
| ISBN | 3-319-31957-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recomb Retrospectives -- The Second Decade of the International Conference on Research in Computational Molecular Biology (RECOMB) -- Extended Abstracts -- A MAD-Bayes Algorithm for State-space Inference and Clustering with Application to Querying Large Collections of ChIP-Seq Data Sets -- Accurate Recovery of Ribosome Positions Reveals Slow Translation of Wobble-Pairing Codons in Yeast -- Multitask matrix completion for learning protein interactions across diseases -- pathTiMEx: Joint Inference of Mutually Exclusive Cancer Pathways and their Dependencies in Tumor Progression -- Clonality inference from single tumor samples using low coverage sequence data -- Flexible Modelling of Genetic Effects on Function-Valued Traits -- MetaFlow: Metagenomic profiling based on whole-genome coverage analysis with min-cost flows -- LUTE (Local Unpruned Tuple Expansion): Accurate continuously flexible protein design with general energy functions and rigid-rotamerlike efficiency -- Improving Bloom filter performance on sequence data using k-mer Bloom filters.-Safe and complete contig assembly via omnitigs -- Long single-molecule reads can resolve the complexity of the Influenza virus composed of rare, closely related mutant variants.-Structural variation detection with read pair information { An improved null-hypothesis reduces bias -- On Computing Breakpoint Distances for Genomes with Duplicate Genes -- New Genome Similarity Measures based on Conserved Gene Adjacencies -- Fast Phylogenetic Biodiversity Computations Under a Non-Uniform Random Distribution -- Short Abstracts -- SLICER: Inferring Branched, Nonlinear Cellular Trajectories from Single Cell RNA-seq Data -- Multi-track modeling for genome-scale reconstruction of 3D chromatin structure from Hi-C data -- Revealing the Genetic Basis of Immune Traits in the Absence of Experimental Immunophenotyping -- Shall we dense? Comparing design strategies for time series expression experiments -- Enabling Privacy-Preserving GWAS in Heterogeneous Human Populations -- Efficient Privacy-Preserving Read Mapping Using Locality Sensitive Hashing and Secure Kmer Voting -- Finding Mutated Subnetworks Associated with Survival Time in Cancer -- Multi-State Perfect Phylogeny Mixture Deconvolution and Applications to Cancer Sequencing -- Tree inference for single-cell data -- mLDM: a new hierarchical Bayesian statistical model for sparse microbial association discovery -- Low-density locality-sensitive hashing boosts metagenomic binning -- metaSPAdes: a new versatile de novo metagenomics assembler -- Distributed Gradient Descent in Bacterial Food Search.-AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments -- Fast Bayesian Inference of Copy Number Variants using Hidden Markov Models with Wavelet Compression -- Allele-Specific Quantification of Structural Variations in Cancer Genomes -- Assembly of Long Error-Prone Reads Using de Bruijn Graphs -- Locating a Tree in a Reticulation-Visible Network in Cubic Time -- Joint alignment of multiple protein-protein interaction networks via convex optimization -- Complexes Detection in Biological Networks via Diversified Dense Subgraphs Mining. |
| Record Nr. | UNISA-996465704403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Research in Computational Molecular Biology : 20th Annual Conference, RECOMB 2016, Santa Monica, CA, USA, April 17-21, 2016, Proceedings / / edited by Mona Singh
| Research in Computational Molecular Biology : 20th Annual Conference, RECOMB 2016, Santa Monica, CA, USA, April 17-21, 2016, Proceedings / / edited by Mona Singh |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXXIV, 274 p. 64 illus., 41 illus. in color.) |
| Disciplina | 570.285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Biomathematics Algorithms Data mining Data structures (Computer science) Computational Biology/Bioinformatics Mathematical and Computational Biology Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery Data Structures |
| ISBN | 3-319-31957-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recomb Retrospectives -- The Second Decade of the International Conference on Research in Computational Molecular Biology (RECOMB) -- Extended Abstracts -- A MAD-Bayes Algorithm for State-space Inference and Clustering with Application to Querying Large Collections of ChIP-Seq Data Sets -- Accurate Recovery of Ribosome Positions Reveals Slow Translation of Wobble-Pairing Codons in Yeast -- Multitask matrix completion for learning protein interactions across diseases -- pathTiMEx: Joint Inference of Mutually Exclusive Cancer Pathways and their Dependencies in Tumor Progression -- Clonality inference from single tumor samples using low coverage sequence data -- Flexible Modelling of Genetic Effects on Function-Valued Traits -- MetaFlow: Metagenomic profiling based on whole-genome coverage analysis with min-cost flows -- LUTE (Local Unpruned Tuple Expansion): Accurate continuously flexible protein design with general energy functions and rigid-rotamerlike efficiency -- Improving Bloom filter performance on sequence data using k-mer Bloom filters.-Safe and complete contig assembly via omnitigs -- Long single-molecule reads can resolve the complexity of the Influenza virus composed of rare, closely related mutant variants.-Structural variation detection with read pair information { An improved null-hypothesis reduces bias -- On Computing Breakpoint Distances for Genomes with Duplicate Genes -- New Genome Similarity Measures based on Conserved Gene Adjacencies -- Fast Phylogenetic Biodiversity Computations Under a Non-Uniform Random Distribution -- Short Abstracts -- SLICER: Inferring Branched, Nonlinear Cellular Trajectories from Single Cell RNA-seq Data -- Multi-track modeling for genome-scale reconstruction of 3D chromatin structure from Hi-C data -- Revealing the Genetic Basis of Immune Traits in the Absence of Experimental Immunophenotyping -- Shall we dense? Comparing design strategies for time series expression experiments -- Enabling Privacy-Preserving GWAS in Heterogeneous Human Populations -- Efficient Privacy-Preserving Read Mapping Using Locality Sensitive Hashing and Secure Kmer Voting -- Finding Mutated Subnetworks Associated with Survival Time in Cancer -- Multi-State Perfect Phylogeny Mixture Deconvolution and Applications to Cancer Sequencing -- Tree inference for single-cell data -- mLDM: a new hierarchical Bayesian statistical model for sparse microbial association discovery -- Low-density locality-sensitive hashing boosts metagenomic binning -- metaSPAdes: a new versatile de novo metagenomics assembler -- Distributed Gradient Descent in Bacterial Food Search.-AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments -- Fast Bayesian Inference of Copy Number Variants using Hidden Markov Models with Wavelet Compression -- Allele-Specific Quantification of Structural Variations in Cancer Genomes -- Assembly of Long Error-Prone Reads Using de Bruijn Graphs -- Locating a Tree in a Reticulation-Visible Network in Cubic Time -- Joint alignment of multiple protein-protein interaction networks via convex optimization -- Complexes Detection in Biological Networks via Diversified Dense Subgraphs Mining. |
| Record Nr. | UNINA-9910484519403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||