Research in Computational Molecular Biology
Home > Mathematics and Science Textbooks > Science: general issues > Maths for scientists > Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings(9029 Lecture Notes in Computer Science)
Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings(9029 Lecture Notes in Computer Science)

Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings(9029 Lecture Notes in Computer Science)

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the refereed proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2015, held in Warsaw, Poland, in April 2015. The 36 extended abstracts were carefully reviewed and selected from 170 submissions. They report on original research in all areas of computational molecular biology and bioinformatics.

Table of Contents:
Efficient Alignment Free Sequence Comparison with Bounded Mismatches.- DockStar: A Novel ILP Based Integrative Method for Structural Modelling of Multimolecular Protein Complexes.- CRISPR Detection from Short Reads Using Partial Overlap Graphs.- Hap Tree-X: An Integrative Bayesian Framework for Haplotype Reconstruction from Transcriptome and Genome Sequencing Data.- Read Clouds Uncover Variation in Complex Regions of the Human Genome.- Learning Microbial Interaction Networks from Metagenomic Count Data.- Immunoglobulin Classification Using the Colored Antibody Graph.- CIDANE: Comprehensive Isoform Discovery and Abundance Estimation.- Diffusion Component Analysis: Unraveling Functional Topology in Biological Networks.- Fragmentation Trees Reloaded.- KGSrna: Efficient 3D Kinematics-Based Sampling for Nucleic Acids.- Locating a Tree in a Phylogenetic Network in Quadratic Time.- Constructing Structure Ensembles of Intrinsically Disordered Proteins from Chemical Shift Data.- COMETS (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence.- Efficient and Accurate Multiple-Phenotypes Regression Method for High Dimensional Data Considering Population Structure.- BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design.- An Efficient Nonlinear Regression Approach for Genome-wide Detection of Marginal and Interacting Genetic Variations.- Exploration of Designability of Proteins Using Graph Features of Contact Maps: Beyond Lattice Models.- CoMEt: A Statistical Approach to Identify Combinations of Mutually Exclusive Alterations in Cancer.- Deep Feature Selection: Theory and Application to Identify Enhancers and Promoters.- Protein Contact Prediction by Integrating Joint Evolutionary Coupling Analysis and Supervised Learning.- ScaffMatch: Scaffolding Algorithm Basedon Maximum Weight Matching.- Symmetric Length-Aware Enrichment Test.- Functional Alignment of Metabolic Networks.- Joint Inference of Genome Structure and Content in Heterogeneous Tumor Samples.- Ultra-Large Alignments Using Ensembles of Hidden Markov Models.- Topological Signatures for Population Admixture.- Haplotype Allele Frequency (HAF) Score: Predicting Carriers of Ongoing Selective Sweeps Without Knowledge of the Adaptive Allele.- Gap Filling as Exact Path Length Problem.- Deconvolution of Ensemble Chromatin Interaction Data Reveals the Latent Mixing Structures in Cell Subpopulations.- A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.- Deciding When to Stop: Efficient Experimentation to Learn to Predict Drug-Target Interactions.- On the Sample Complexity of Cancer Pathways Identification.- A Novel Probabilistic Methodology for eQTL Analysis of Signaling Networks.- Rapidly Registering Identity-by-Descent Across Ancestral Recombination Graphs.- Computational Protein Design Using AND/OR Branch-and-Bound Search.


Best Sellers


Product Details
  • ISBN-13: 9783319167053
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Height: 235 mm
  • No of Pages: 368
  • Returnable: Y
  • Series Title: 9029 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 3319167057
  • Publisher Date: 25 Mar 2015
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 9029 Lecture Notes in Computer Science
  • Sub Title: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings(9029 Lecture Notes in Computer Science)
Springer International Publishing AG -
Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings(9029 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings(9029 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!