@conference {14621,
	title = {Hardness of flip-cut problems from optical mapping [DNA molecules application]},
	booktitle = {Compression and Complexity of Sequences 1997. Proceedings},
	year = {1997},
	month = {1997/06/11/13},
	pages = {275 - 284},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Optical mapping is a new technology for constructing restriction maps. Associated computational problems include aligning multiple partial restriction maps into a single {\textquotedblleft}consensus{\textquotedblright} restriction map, and determining the correct orientation of each molecule, which was formalized as the exclusive binary flip cut (EBFC) problem by Muthukrishnan and Parida (see Proc. of the First ACM Conference on Computational Molecular Biology (RECOMB), Santa Fe, p.209-19, 1997). Here, the authors prove that the EBFC problem, as well as a number of its variants, are NP-complete. They also identify another problem formalized as binary shift cut (BSC) problem motivated by the fact that there might be missing fragments at the beginnings and/or the ends of the molecules, and prove it to be NP-complete. Therefore, they do not have efficient, that is, polynomial time solutions unless P=NP},
	keywords = {binary shift cut, Biochemistry, Bioinformatics, biological techniques, Biology, biomedical optical imaging, combinatorial mathematics, combinatorial problem, computational complexity, computational problems, DNA, DNA molecule, exclusive binary flip cut, flip-cut problem hardness, Genetic engineering, Genomics, MATHEMATICS, molecular biology, molecular biophysics, molecule orientation, multiple partial restriction maps, NP-complete problem, optical mapping, polynomial time solutions, Polynomials, sequences},
	isbn = {0-8186-8132-2},
	doi = {10.1109/SEQUEN.1997.666922},
	author = {Dancik,V. and Hannenhalli, Sridhar and Muthukrishnan,S.}
}
@article {11994,
	title = {Visual shape computation},
	journal = {Proceedings of the IEEE},
	volume = {76},
	year = {1988},
	month = {1988/08//},
	pages = {899 - 916},
	abstract = {Perceptual processes responsible for computing shape from several cues, including shading, texture, contour, and stereo, are examined. It is noted that these computational problems, as well as that of computing shaping from motion, are ill-posed in the sense of Hadamard. It is suggested that regularization theory can be used along with a priori knowledge to restrict the space of possible solutions, and thus restore the problem{\textquoteright}s well-prosedness. Some alternative methods are outlined, and the idea of active vision is explored briefly in connection with the problem},
	keywords = {a priori knowledge, active vision, computational problems, Computer vision, computing shaping from motion, contour, cues, Focusing, HUMANS, ill posed problems, Machine vision, Psychology, regularization theory, RETINA, sense of Hadamard, shading, SHAPE, space of possible solutions, Stereo vision, Surface texture, TEXTURE, visual shape computation, Visual system},
	isbn = {0018-9219},
	doi = {10.1109/5.5964},
	author = {Aloimonos, J.}
}
