The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

1.7.9 Shortest Common Superstring 1.7.9 Shortest Common Superstring INPUT OUTPUT Input Description: A set of strings s_1, ..., s_m . Problem: Find the shortest string S which contains each s_i as a substring of S . Implementations ● CAP -- Contig Assembly Program (C) (rating 8) Related Problems ● Longest Common Substring ● Suffix Trees and Arrays ● Text Compression file:///E|/WEBSITE/FILES2/SHORRING.HTM (1 of 2) [19/1/2003 1:37:36]

1.7.9 Shortest Common Superstring Go to the corresponding chapter in the book About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES2/SHORRING.HTM (2 of 2) [19/1/2003 1:37:36]

1.7.9 Shortest Common Superstring<br />

1.7.9 Shortest Common Superstring<br />

INPUT OUTPUT<br />

Input Description: A set of strings s_1, ..., s_m .<br />

Problem: Find the shortest string S which contains each s_i as a substring of S .<br />

Implementations<br />

● CAP -- Contig Assembly Program (C) (rating 8)<br />

Related Problems<br />

● Longest Common Substring<br />

● Suffix Trees and Arrays<br />

● Text Compression<br />

file:///E|/WEBSITE/FILES2/SHORRING.HTM (1 of 2) [19/1/2003 1:37:36]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!