Research in Computational Molecular Biology
Home > Mathematics and Science Textbooks > Biology, life sciences > Molecular biology > Research in Computational Molecular Biology: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, Proceedings
Research in Computational Molecular Biology: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, Proceedings

Research in Computational Molecular Biology: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the proceedings of the 28th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2024, held in Cambridge, MA, USA, during April 29–May 2, 2024. The 57 full papers included in this book were carefully reviewed and selected from 352 submissions. They were organized in topical sections as follows: theoretical and foundational algorithm contributions and more applied directions that engage with new technologies and intriguing biological questions.

Table of Contents:
.- Enhancing gene set analysis in embedding spaces a novel best match approach. .- Prompt based Learning on Large Protein Language Models Improves Signal Peptide Prediction. .- Decoil Reconstructing extrachromosomal DNA structural heterogeneity from longread sequencing data. .- Privacy Preserving Epigenetic PaceMaker Stronger Privacy and Improved Efficiency. .- Mapping Cell Fate Transition in Space and Time. .- Approximate IsoRank for Scalable Global Alignment of Biological Networks. .- Sequential Optimal Experimental Design of Perturbation Screens Guided by Multimodal Priors. .- Efficient Analysis of Annotation Colocalization Accounting for Genomic Contexts. .- Secure federated Boolean count queries using fully homomorphic cryptography. .- FragXsiteDTI Revealing Responsible Segments in Drug Target Interaction with Transformer Driven Interpretation. .- An integer programming framework for identifying stable components in asynchronous Boolean networks. .- ImputeCC enhances integrative Hi C based metagenomic binning through constrained random walk based imputation. .- Graph based genome inference from Hi C data. .- Meta colored de Bruijn graphs. .- Color Coding for the Fragment Based Docking Design and Equilibrium Statistics of Protein Binding ssRNAs. .- Automated design of efficient search schemes for lossless approximate pattern matching. .- CELL E A Text To Image Transformer for Protein Localization Prediction. .- A Scalable Optimization Algorithm for Solving the Beltway and Turnpike Problems with Uncertain Measurements. .- Overcoming Observation Bias for Cancer Progression Modeling. .- Inferring Metabolic States from Single Cell Transcriptomic Data via Geometric Deep Learning. .- Computing robust optimal factories in metabolic reaction networks. .- Undesignable RNA Structure Identification via Rival Structure Generation and Structure Decomposition. .- Structure and Function Aware Substitution Matrices via Learnable Graph Matching. .- Secure Discovery of Genetic Relatives across Large Scale and Distributed Genomic Datasets. .- GFETM Genome Foundation based Embedded Topic Model for scATAC seq Modeling. .- SEM sized based expectation maximization for characterizing nucleosome positions and subtypes. .- Centrifuger lossless compression of microbial genomes for efficient and accurate metagenomic sequence classification. .- BONOBO Bayesian Optimized sample specific Networks Obtained By Omics data. .- regLM Designing realistic regulatory DNA with autoregressive language models. .- DexDesign A new OSPREY based algorithm for designing de novo D peptide inhibitors. .- Memory bound and taxonomy aware kmer selection for ultra large reference libraries. .- SpaCeNet Spatial Cellular Networks from omics data. .- Discovering and overcoming the bias in neoantigen identification by unified machine learning models. .- MaSk LMM A Matrix Sketching Framework for Linear Mixed Models in Association Studies. .- Community structure and temporal dynamics of viral epistatic networks allow for early detection of emerging variants with altered phenotypes. .- Maximum Likelihood Inference of Time scaled Cell Lineage Trees with Mixed type Missing Data. .- TRIBAL Tree Inference of B cell Clonal Lineages. .- Mapping the topography of spatial gene expression with interpretable deep learning. .- GraSSRep Graph Based Self Supervised Learning for Repeat Detection in Metagenomic Assembly. .- PRS Net Interpretable polygenic risk scores via geometric learning. .- Haplotype aware sequence alignment to pangenome graphs. .- Disease Risk Predictions with Differentiable Mendelian Randomization. .- DIISCO A Bayesian framework for inferring dynamic intercellular interactions from time series single cell data. .- Protein domain embeddings for fast and accurate similarity search. .- Processing bias correction with DEBIAS M improves cross study generalization of microbiome based prediction models. .- VICTree a Variational Inference method for Clonal Tree reconstruction. .- DeST OT Alignment of Spatiotemporal Transcriptomics Data. .- Determining Optimal Placement of Copy Number Aberration Impacted Single Nucleotide Variants in a Tumor Progression History. .- Accurate Assembly of Circular RNAs with TERRACE. .- Semi Supervised Learning While Controlling the FDR With an Application to Tandem Mass Spectrometry Analysis. .- CoRAL accurately resolves extrachromosomal DNA genome structures with long read sequencing. .- A Scalable Adaptive Quadratic Kernel Method for Interpretable Epistasis Analysis in Complex Traits. .- Optimal Tree Metric Matching Enables Phylogenomic Branch Length Estimation. .- Inferring allele specific copy number aberrations and tumor phylogeography from spatially resolved transcriptomics. .- Contrastive Fitness Learning Reprogramming Protein Language Models for Low N Learning of Protein Fitness Landscape. .- Scalable summary statistics based heritability estimation method with individual genotype level accuracy. .- scMulan a multitask generative pre trained language model for single cell analysis.


Best Sellers


Product Details
  • ISBN-13: 9781071639887
  • Publisher: Springer-Verlag New York Inc.
  • Publisher Imprint: Springer-Verlag New York Inc.
  • Height: 235 mm
  • No of Pages: 486
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 1071639889
  • Publisher Date: 17 May 2024
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, 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: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, Proceedings
Springer-Verlag New York Inc. -
Research in Computational Molecular Biology: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, Proceedings
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: 28th Annual International Conference, RECOMB 2024, Cambridge, MA, USA, April 29–May 2, 2024, Proceedings

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!