Fig.:
A series-parallel graph and its decomposition tree
Fig.: Input data for the consecutive ones problem
The consecutive ones problem describes the problem of physical mapping of DNA-sequences. Since the data is usually faulty, the computation of good solutions is in general a hard problem. In the case of strict chimeric errors, we could exactly classify the complexity of this problem in terms of the overlap of the data and the length of the probes.
-->
Kommunikationsnetzwerke, hoheitliche Dokumente, E-Commerce, Immunologie
