On reconstructing a string from its substring compositions

Jump to other IT Society Websites:

On reconstructing a string from its substring compositions


Creation Date: Jun 13, 2013

Published In: Jun 2010

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Austin, TX, USA


Motivated by protein sequencing, we consider the problem of reconstructing a string from thecompositions of its substrings. We provide several results, including the following. General classes of strings that cannot be distinguished from their substring compositions. An almost complete characterization of the lengths for which reconstruction is possible. Bounds on the number of strings with the same substring compositions in terms of the number of divisors of the string length plus one. A relation to the turnpike problem and a bivariate polynomial formulation of string reconstruction.

IEEE Explore link: http://dx.doi.org/10.1109/ISIT.2010.5513668

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:



Table of Contents

IEEE TechNav