title: Locating rearrangement events in a phylogeny based on highly fragmented assemblies.
abstract: BACKGROUND
  The inference of genome rearrangement operations requires complete genome assemblies as input data, since a rearrangement can involve an arbitrarily large proportion of one or more chromosomes. Most genome sequence projects, especially those on non-model organisms for which no physical map exists, produce very fragmented assembles, so that a rearranged fragment may be impossible to identify because its two endpoints are on different scaffolds. However, breakpoints are easily identified, as long as they do not coincide with scaffold ends. For the phylogenetic context, in comparing a fragmented assembly with a number of complete assemblies, certain combinatorial constraints on breakpoints can be derived. We ask to what extent we can use breakpoint data between a fragmented genome and a number of complete genomes to recover all the arrangements in a phylogeny.
  
  
  RESULTS
  We simulate genomic evolution via chromosomal inversion, fragmenting one of the genomes into a large number of scaffolds to represent the incompleteness of assembly. We identify all the breakpoints between this genome and the remainder. We devise an algorithm which takes these breakpoints into account in trying to determine on which branch of the phylogeny a rearrangement event occurred. We present an analysis of the dependence of recovery rates on scaffold size and rearrangement rate, and show that the true tree, the one on which the rearrangement simulation was performed, tends to be most parsimonious in estimating the number of true events inferred.
  
  
  CONCLUSIONS
  It is somewhat surprising that the breakpoints identified just between the fragmented genome and each of the others suffice to recover most of the rearrangements produced by the simulations. This holds even in parts of the phylogeny disjoint from the lineage of the fragmented genome.
authors.affiliation: Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, Ottawa, K1N 6N5, Canada.
authors.forename: Chunfang
authors.initials: C
authors.lastname: Zheng
authors.affiliation: Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, Ottawa, K1N 6N5, Canada. sankoff@uottawa.ca.
authors.forename: David
authors.initials: D
authors.lastname: Sankoff
mesh_terms: D000465:Algorithms; D002965:Classification / Q000379:methods*; D015321:Gene Rearrangement / Q000502:physiology*; D016678:Genome; D010802:Phylogeny; D010944:Plants / Q000145:classification* / Q000235:genetics
references.citation: Plant Physiol. 2008 Dec;148(4):1772-81
references.pmid: 18952863
references.citation: Proc Natl Acad Sci U S A. 2003 Jun 24;100(13):7672-7
references.pmid: 12810957
references.citation: Plant J. 2008 Feb;53(4):661-73
references.pmid: 18269575
references.citation: BMC Bioinformatics. 2010 Jun 04;11:304
references.pmid: 20525342
references.citation: IEEE/ACM Trans Comput Biol Bioinform. 2010 Oct-Dec;7(4):579-87
references.pmid: 20714028
references.citation: Genetics. 2004 Feb;166(2):935-45
references.pmid: 15020478
references.citation: Science. 2009 Oct 9;326(5950):236-7
references.pmid: 19815760