Section 3 compares the prokaryotic genome ranking problem with the sports rating problem.
The genome ancestry problem was modeled as a combinatorial optimization problem in Zhang et al. (2008).
Additionally, as the sampling from high-throughput sequencers is not always random across the genome, the problem of inferring deletions is conflated with the problem of detecting sampling bias, particularly for hemizygous deletions.
It presents a series of models, beginning with the simplest (which is progressively extended by dropping restrictions), each constructing a genome rearrangement problem.
In assembling the T. parvula genome, the problem was mitigated by (i) using reads from different technologies, (ii) using paired reads with different insert lengths to span different repeat lengths and (iii) computationally selecting high quality reads.
Finally, we did not test any of the numerous pairwise aligners or pairwise synteny mapping methods, as our work focuses on the multiple genome alignment problem.
They formulated the copy number and adjacency genome reconstruction problem.
Other computationally efficient approaches for solving the genome ancestry problem have largely ignored the breeding scheme.
This is because fuzzy clustering adds computational complexity and is unnecessary for the genome clustering problem.
Here we use bidirected string graph to model the genome assembly problem.
