A polyhedral approach to RNA sequence structure alignment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A polyhedral approach to RNA sequence structure alignment

Full text

Pdf (1.04 MB)

Source

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

New York, New York, United States

Pages: 153 - 162

Year of Publication: 1998

ISBN:0-89791-976-9

Authors

Hans-Peter Lenhof	MPI für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
Knut Reinert	MPI für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
Martin Vingron	Deutsches Krebsforschungszentrum, Abt. Theoretische, Bioinformatik, INF 280, D-69120 Heidelberg, Germany

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 11, Citation Count: 3

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/279069.279109 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.

	BMR95	Vineet Bafna, S. MuthmkSshnan, and R. Ravi. Computing similarity between tL~,TA strings. In Zvi Galil and Esko Ukkonen, editors, Combinatorial Pattern Matching, pages 1-16, Espoo, Finland, july 1995. Springer.
	CJK+97	Thomas Christof , Michael Jünger , John Kececioglu , Petra Mutzel , Gerhard Reinelt, A branch-and-cut approach to physical mapping with end-probes, Proceedings of the first annual international conference on Computational molecular biology, p.84-92, January 20-23, 1997, Santa Fe, New Mexico, United States [doi>10.1145/267521.267532]
	CM94	Florence Corpet and Bernard Michot. RNAlign program: alignment of RNA sequences using both primary and secondary structures. CABIOS, 10(4):389- 399, 1994.
	dRdPCdW94	P. de Rijk, Y. Van de Peer, S. Chapelle, and tL de Wachter. Database on the structure of small ribosomal subunit RNA. Nucleic Acids Research, 22:3495- 3501, 1994.
	ED94	Sean P~ Eddy and Richard Durbin. RNA sequence analysis using covariance models. Nucleic Acids Research, 22(11):2079-2088, 1994.
	GHS97	3. Gorodtdn, L. J. Heyer, and G. D. Stormo. Finding the most significant common sequence and structure motifs in a set of RNA sequences. Nucleic Acids Research, 25:3724-3732, 1997.
	JT97	M. Jfmger and S. Thienel. The design of the branch and cut system ABA- CUS. Technical Report No. 97.260, Institut ffr Informatik, UniversitSt zu I{51n, 1997.
	Lev69	M. Levitt. Detailed molecular model for transfer ribonucleic acid. Nature, 224:759-763, 1969.
	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 paddng and independence system polyhedra. Mathematical Programming, 6:48-61, 1973.
	NW88	George L. Nemhauser , Laurence A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience, New York, NY, 1988
	RLM+97	K. Reinert , H.-P. Lenhof , P. Mutzel , K. Mehlhorn , J. D. Kececioglu, A branch-and-cut algorithm for multiple sequence alignment, Proceedings of the first annual international conference on Computational molecular biology, p.241-250, January 20-23, 1997, Santa Fe, New Mexico, United States [doi>10.1145/267521.267845]
	San85	D. Sankoff. Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM Journal on Applied Mathematics, 45(5):810-825, 1985.
	TIAS77	S. Tsuldyama, M. Ide, H. Ariyoshi, and I. Shirawaka. A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing, 6:505-517, 1977.
	Wat89	Michael S. Waterman. Consensus methods for folding single-stranded nucleic adds. In Mathematical Methods .for DNA Sequences., pages 185-224. CRC Press, Boca Raton, FI, 1989.

CITED BY 3

	Guo-Hui Lin , Bin Ma , Kaizhong Zhang, Edit distance between two RNA structures, Proceedings of the fifth annual international conference on Computational biology, p.211-220, April 22-25, 2001, Montreal, Quebec, Canada
	Guohui Lin , Zhi-Zhong Chen , Tao Jiang , Jianjun Wen, The longest common subsequence problem for sequences with nested arc annotations, Journal of Computer and System Sciences, v.65 n.3, p.465-480, November 2002
	Sebastian Will , Anke Busch , Rolf Backofen, Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination, Constraints, v.13 n.1-2, p.110-129, June 2008