On the number of alignments of k sequences
dc.contributor.author | Hanlon, P. | en_US |
dc.contributor.author | Griggs, J. R. | en_US |
dc.contributor.author | Odlyzko, Andrew M. | en_US |
dc.contributor.author | Waterman, M. S. | en_US |
dc.date.accessioned | 2006-09-08T19:24:57Z | |
dc.date.available | 2006-09-08T19:24:57Z | |
dc.date.issued | 1990-06 | en_US |
dc.identifier.citation | Griggs, J. R.; Hanlon, P.; Odlyzko, A. M.; Waterman, M. S.; (1990). "On the number of alignments of k sequences." Graphs and Combinatorics 6(2): 133-146. <http://hdl.handle.net/2027.42/41582> | en_US |
dc.identifier.issn | 1435-5914 | en_US |
dc.identifier.issn | 0911-0119 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/41582 | |
dc.description.abstract | Numerous studies by molecular biologists concern the relationships between several long DNA sequences, which are listed in rows with some gaps inserted and with similar positions aligned vertically. This motivates our interest in estimating the number of possible arrangements of such sequences. We say that a k sequence alignment of size n is obtained by inserting some (or no) 0's into k sequences of n 1's so that every sequence has the same length and so that there is no position which is 0 in all k sequences. We show by a combinatorial argument that for any fixed k ≥1, the number f(k, n) of k alignments of length n grows like ( c k ) n as n → ∞ , where c k = (2 1/ k − 1) -k . A multi-dimensional saddle-point method is used to give a more precise estimate for f(k, n). | en_US |
dc.format.extent | 702865 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Engineering Design | en_US |
dc.title | On the number of alignments of k sequences | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, Caltech, 91125, Pasadena, CA, USA; Department of Mathematics, University of Michigan, 48109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | AT&T Bell Laboratories, 07974, Murray Hill, NJ, USA | en_US |
dc.contributor.affiliationother | Department of Mathematics, University of South Carolina, 29208, Columbia, SC, USA | en_US |
dc.contributor.affiliationother | Departments of Mathematics and Molecular Biology, University of Southern California, 90089, Los Angeles, CA, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/41582/1/373_2005_Article_BF01787724.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01787724 | en_US |
dc.identifier.source | Graphs and Combinatorics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.