title: Recombination-aware alignment of diploid individuals.
abstract: BACKGROUND
  Traditionally biological similarity search has been studied under the abstraction of a single string to represent each genome. The more realistic representation of diploid genomes, with two strings defining the genome, has so far been largely omitted in this context. With the development of sequencing techniques and better phasing routines through haplotype assembly algorithms, we are not far from the situation when individual diploid genomes could be represented in their full complexity with a pair-wise alignment defining the genome.
  
  
  RESULTS
  We propose a generalization of global alignment that is designed to measure similarity between phased predictions of individual diploid genomes. This generalization takes into account that individual diploid genomes evolve through a mutation and recombination process, and that predictions may be erroneous in both dimensions. Even though our model is generic, we focus on the case where one wants to measure only the similarity of genome content allowing free recombination. This results into efficient algorithms for direct application in (i) evaluation of variation calling predictions and (ii) progressive multiple alignments based on labeled directed acyclic graphs (DAGs) to represent profiles. The latter may be of more general interest, in connection to covering alignment of DAGs. Extensions of our model and algorithms can be foreseen to have applications in evaluating phasing algorithms, as well as more fundamental role in phasing child genome based on parent genomes.
authors.forename: Veli
authors.initials: V
authors.lastname: Mäkinen
authors.forename: Daniel
authors.initials: D
authors.lastname: Valenzuela
mesh_terms: D000465:Algorithms; D004171:Diploidy; D023281:Genomics / Q000379:methods*; D008957:Models, Genetic; D011995:Recombination, Genetic