A Greedy Algorithm for the Shortest Common Superstring is Asymptotically Optimal