Research in Computational Molecular Biology: 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $13.30
Usually ships in 1-2 business days
(Save 91%)
Other sellers (Paperback)
  • All (9) from $13.30   
  • New (6) from $93.34   
  • Used (3) from $0.00   


This book constitutes the refereed proceedings of the 10th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2006, held in Venice, Italy in April 2006.

The 40 revised full papers presented together with abstracts of 7 keynote talks were carefully reviewed and selected from 212 submissions. As the top conference in computational molecular biology, RECOMB addresses all current issues in algorithmic, theoretical, and experimental bioinformatics.

Read More Show Less

Product Details

Table of Contents

Integrated Protein Interaction Networks for 11 Microbes.- Hypergraph Model of Multi-residue Interactions in Proteins: Sequentially–Constrained Partitioning Algorithms for Optimization of Site-Directed Protein Recombination.- Biological Networks: Comparison, Conservation, and Evolutionary Trees.- Assessing Significance of Connectivity and Conservation in Protein Interaction Networks.- Clustering Short Gene Expression Profiles.- A Patient-Gene Model for Temporal Expression Profiles in Clinical Studies.- Global Interaction Networks Probed by Mass Spectrometry.- Statistical Evaluation of Genome Rearrangement.- An Improved Statistic for Detecting Over-Represented Gene Ontology Annotations in Gene Sets.- Protein Function Annotation Based on Ortholog Clusters Extracted from Incomplete Genomes Using Combinatorial Optimization.- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data.- RNA Secondary Structure Prediction Via Energy Density Minimization.- Structural Alignment of Pseudoknotted RNA.- Stan Ulam and Computational Biology.- CONTRAlign: Discriminative Training for Protein Sequence Alignment.- Clustering Near-Identical Sequences for Fast Homology Search.- New Methods for Detecting Lineage-Specific Selection.- A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer.- A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric.- Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations.- Inferring Common Origins from mtDNA.- Efficient Enumeration of Phylogenetically Informative Substrings.- Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes.- Maximal Accurate Forests from Distance Matrices.- Leveraging Information Across HLA Alleles/Supertypes Improves Epitope Prediction.- Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence.- An Important Connection Between Network Motifs and Parsimony Models.- Ultraconserved Elements, Living Fossil Transposons, and Rapid Bursts of Change: Reconstructing the Uneven Evolutionary History of the Human Genome.- Permutation Filtering: A Novel Concept for Significance Analysis of Large-Scale Genomic Data.- Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes.- A New Approach to Protein Identification.- Markov Methods for Hierarchical Coarse-Graining of Large Protein Dynamics.- Simulating Protein Motions with Rigidity Analysis.- Predicting Experimental Quantities in Protein Folding Kinetics Using Shastic Roadmap Simulation.- An Outsider’s View of the Genome.- Alignment Statistics for Long-Range Correlated Genomic Sequences.- Simple and Fast Inverse Alignment.- Revealing the Proteome Complexity by Mass Spectrometry.- Motif Yggdrasil: Sampling from a Tree Mixture Model.- A Study of Accessible Motifs and RNA Folding Complexity.- A Parameterized Algorithm for Protein Structure Alignment.- Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction.- A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem.- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles.- 10 Years of the International Conference on Research in Computational Molecular Biology (RECOMB).- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.- A Parsimony Approach to Genome-Wide Ortholog Assignment.- Detecting the Dependent Evolution of Biosequences.- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)