A branch-and-cut algorithm for multiple sequence alignment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A branch-and-cut algorithm for multiple sequence alignment

Full text

Pdf (1.17 MB)

Source

Annual Conference on Research in Computational Molecular Biology archive
Proceedings of the first annual international conference on Computational molecular biology table of contents

Santa Fe, New Mexico, United States

Pages: 241 - 250

Year of Publication: 1997

ISBN:0-89791-882-7

Authors

K. Reinert	MPI für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
H.-P. Lenhof	MPI für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
P. Mutzel	MPI für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
K. Mehlhorn	MPI für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
J. D. Kececioglu	Department of Computer Science, The University of Georgia, Athens, Georgia

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
DOE : Department of Energy

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 19, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/267521.267845 What is a DOI?

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.

	GP85	M. GrStschel and M.W. Padberg. Polyhedral theory. Wiley-lnterscience, 1985.
	HJP75	P.L. Hammer, E.L. Johnson, and U.N. Peled. Facets of regular 0-1-polytopes. Mathematical Programming, 8:179-206, 1975.
	Kec91	John Dimitri Kececioglu, Exact and approximation algorithms for DNA sequence reconstruction, University of Arizona, Tucson, AZ, 1992
	Kec93	John D. Kececioglu, The Maximum Weight Trace Problem in Multiple Sequence Alignment, Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, p.106-119, June 02-04, 1993
	Kec96	John D. Kececioglu. PRIMAL: Practical rigorous multiple alignment. Computer software, 1996.
	MN95	Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, v.38 n.1, p.96-102, Jan. 1995 [doi>10.1145/204865.204889]
	NT73	G.L. Nemhauser and L.E. Trotter. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6:48-61, 1973.
	PW93	Pavel A. Pevzner , Michael S. Waterman, Generalized sequence alignment and duality, Advances in Applied Mathematics, v.14 n.2, p.139-171, June 1993 [doi>10.1006/aama.1993.1008]
	Thi95	Stefan Thienel. ABACUS: A Branch-And- CUI System. Phd THesis, Universitat. Koln. 1995.

CITED BY 5

	Hans-Peter Lenhof , Knut Reinert , Martin Vingron, A polyhedral approach to RNA sequence structure alignment, Proceedings of the second annual international conference on Computational molecular biology, p.153-162, March 22-25, 1998, New York, New York, United States
	Giuseppe Lancia, Integer programming models for computational biology problems, Journal of Computer Science and Technology, v.19 n.1, p.60-77, January 2004
	Marina Barsky , Ulrike Stege , Alex Thomo , Chris Upton, A graph approach to the threshold all-against-all substring matching problem, Journal of Experimental Algorithmics (JEA), 12, June 2008
	Yinglei Song , Chunmei Liu , Xiuzhen Huang , Russell L. Malmberg , Ying Xu , Liming Cai, Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.3 n.4, p.423-432, October 2006
	Rolf Backofen , David Gilbert, Bioinformatics and Constraints, Constraints, v.6 n.2-3, p.141-156, June 2001