Change search
ReferencesLink to record
Permanent link

Direct link
Approximating the expected number of inversions given the number of breakpoints
Dept. of Mathematics, Royal Institute of Technology, Stockholm.ORCID iD: 0000-0002-6444-7878
2002 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2452, 316-330 p.Article in journal (Refereed) Published
Abstract [en]

We look at a problem with motivation from computational biology: Given the number of breakpoints in a permutation (representing a gene sequence), compute the expected number of inversions that have occured. For this problem, we obtain an analytic approximation that is correct within a percent or two. For the inverse problem, computing the expected number of breakpoints after any number of inversions, we obtain an analytic approximation with an error of less than a hundredth of a breakpoint.

Place, publisher, year, edition, pages
Berlin, Germany: Springer Berlin/Heidelberg, 2002. Vol. 2452, 316-330 p.
National Category
Mathematics Discrete Mathematics
URN: urn:nbn:se:oru:diva-41723ISI: 000187294100024ISBN: 3-540-44211-1OAI: diva2:781039
2nd International workshop on Algorithms in Bioinformatics, WABI 2002, Rome, Italy, Sep. 17-21, 2002
Available from: 2015-01-15 Created: 2015-01-15 Last updated: 2015-09-30Bibliographically approved

Open Access in DiVA

fulltext(299 kB)16 downloads
File information
File name FULLTEXT01.pdfFile size 299 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Eriksen, Niklas
In the same journal
Lecture Notes in Computer Science
MathematicsDiscrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 16 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 138 hits
ReferencesLink to record
Permanent link

Direct link