Phase Transition in Computational Complexity of Shortest Common Superstring and Genome Assembly

The author demonstrates a phase transition in the computational complexity of genome assembly, showing that practical instances fall into the 'easy' phase solvable by polynomial-time algorithms. By using statistical mechanics methods, they provide insights into the complexity of the problem.