Distance and Similarity Measures in Comparative Genomics

Research in comparative genomics supports the investigation of important questions in molecular biology, genetics and biomedicine. A central question in this field is the elucidation of similarities and differences between genomes by means of different measures. This summary, submitted to CTD 2020, briefly describes the main contributions, originality and impact possibilities of the thesis entitled "Distance and Similarity Measures in Comparative Genomics", by Diego P. Rubert.

• Publication year

  2020

• Venue

  Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC 2020)

• Publication date

  2020-06-30

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.5753/ctd.2020.11361
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants

  2020cited by this paper
• Computing the family-free DCJ similarity

  2018influential reference
• Algorithms for Computing the Family-Free Genomic Similarity Under DCJ

  2017cited by this paper
• The sunflower genome provides insights into oil metabolism, flowering and Asterid evolution

  2017cited by this paper
• Approximating the DCJ distance of balanced genomes in linear time

  2017influential reference
• Ancestors of modern plant crops.

  2016cited by this paper
• A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates

  2016cited by this paper
• Finding approximate gene clusters with Gecko 3

  2016cited by this paper
• On the family-free DCJ distance and similarity

  2015cited by this paper
• An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

  2015cited by this paper
• The Potential of Family-Free Genome Comparison

  2013cited by this paper
• Gene family assignment-free comparative genomics

  2012cited by this paper
• Efficient Computation of Approximate Gene Clusters Based on Reference Occurrences

  2010cited by this paper
• Scaffold Filling under the Breakpoint Distance

  2010cited by this paper
• Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set

  2006cited by this paper
• Efficient sorting of genomic permutations by translocation, inversion and block interchange

  2005cited by this paper

• Pareamento de Nomes de Produtos e Serviços Utilizando Medidas de Similaridade Textual nos Níveis Alfabético, Léxico e Semântico

  2022cites this paper