Searching for "Shortest Consistent Superstrings Computable in Polynomial Time." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Shortest Consistent Superstrings Computable In Polynomial Time
by Tao Jiang, Vadim G. Timkovsky — 1995 — Comput. Sci
…SHORTEST CONSISTENT SUPERSTRINGS COMPUTABLE IN POLYNOMIAL TIME Tao Jiang and Vadim G. Timkovsky…
Cited by 3 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB