Reconstructing set partitions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Reconstructing set partitions

Full text

Pdf (220 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 915 - 916

Year of Publication: 1999

ISBN:0-89871-434-6

Authors

Vladimir Grebinski	INERIA-Lorraine/LORIA, 615, rue du Jardin Botanique, BP 101, 54602 Villers-lès-Nancy, France
Gregory Kucherov	INERIA-Lorraine/LORIA, 615, rue du Jardin Botanique, BP 101, 54602 Villers-lès-Nancy, France

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 27, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Vladimir Grebinski , Gregory Kucherov, Optimal Reconstruction of Graphs Under the Additive Model, Proceedings of the 5th Annual European Symposium on Algorithms, p.246-258, September 15-17, 1997
	2	Fengzhu Sun, Gary Benson, Norman Arnheim, and Michael S. Waterman. Pooling strategies for establishing physical genome maps using FISH. Journal of Computational Molecular Biology, 4(4):467-485, 1997.