A branch-and-cut algorithm for multiple sequence alignment

Full Text: PDFPDF Buy this ArticleBuy this Article
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
A branch-and-cut algorithm for multiple sequence alignment Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 458
· Citation Count: 12

Published in:
Cover Image
 
· Proceeding
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Pages 241-250
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-882-7 doi>10.1145/267521.267845

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder