Shortest consistent superstrings computable in polynomial time
From MaRDI portal
Publication:673640
DOI10.1016/0304-3975(95)80027-7zbMath0873.68040MaRDI QIDQ673640
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)80027-7
DB lookup for MSC labels failed