• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 17 matches

• 2017
• 
  Sergey Aganezov Jr., Max A. Alekseyev:
  Orientation of Ordered Scaffolds. RECOMB-CG 2017: 179-196
• 
  Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
  A Unified ILP Framework for Genome Median, Halving, and Aliquoting Problems Under DCJ. RECOMB-CG 2017: 156-178
• 
  Leonid Chindelevitch, João Meidanis:
  On the Rank-Distance Median of 3 Permutations. RECOMB-CG 2017: 256-276
• 
  Ryan A. Leo Elworth, Luay Nakhleh:
  Inferring Local Genealogies on Closely Related Genomes. RECOMB-CG 2017: 213-231
• 
  Pedro Feijão, Aniket C. Mane, Cédric Chauve:
  A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes. RECOMB-CG 2017: 14-30
• 
  Eli Goz, Yael Tsalenchuck, Rony Oren Benaroya, Shimshi Atar, Tahel Altman, Justin Julander, Tamir Tuller:
  Generation and Comparative Genomics of Synthetic Dengue Viruses. RECOMB-CG 2017: 31-52
• 
  Han Lai, Maureen Stolzer, Dannie Durand:
  Fast Heuristics for Resolving Weakly Supported Branches Using Duplication, Transfers, and Losses. RECOMB-CG 2017: 298-320
• 
  Uyen Mai, Siavash Mirarab:
  TreeShrink: Efficient Detection of Outlier Tree Leaves. RECOMB-CG 2017: 116-140
• 
  Michael Nute, Jed Chou:
  Statistical Consistency of Coalescent-Based Species Tree Methods Under Models of Missing Data. RECOMB-CG 2017: 277-297
• 
  Jaroslaw Paszek, Pawel Górecki:
  New Algorithms for the Genomic Duplication Problem. RECOMB-CG 2017: 101-115
• 
  Sylvain Pulicani, Pijus Simonaitis, Eric Rivals, Krister M. Swenson:
  Rearrangement Scenarios Guided by Chromatin Structure. RECOMB-CG 2017: 141-155
• 
  Diego P. Rubert, Gabriela Medeiros, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez:
  Algorithms for Computing the Family-Free Genomic Similarity Under DCJ. RECOMB-CG 2017: 76-100
• 
  Tizian Schulz, Jens Stoye, Daniel Doerr:
  Finding Teams in Graphs and Its Application to Spatial Gene Cluster Discovery. RECOMB-CG 2017: 197-212
• 
  Pranjal Vachaspati, Tandy J. Warnow:
  Enhancing Searches for Optimal Trees Using SIESTA. RECOMB-CG 2017: 232-255
• 
  Yue Zhang, David Sankoff:
  The Similarity Distribution of Paralogous Gene Pairs Created by Recurrent Alternation of Polyploidization and Fractionation. RECOMB-CG 2017: 1-13
• 
  Chao Zhang, Erfan Sayyari, Siavash Mirarab:
  ASTRAL-III: Increased Scalability and Impacts of Contracting Low Support Branches. RECOMB-CG 2017: 53-75
• 
  Joao Meidanis, Luay Nakhleh:
  Comparative Genomics - 15th International Workshop, RECOMB CG 2017, Barcelona, Spain, October 4-6, 2017, Proceedings. Lecture Notes in Computer Science 10562, Springer 2017, ISBN 978-3-319-67978-5 [contents]