Approximating the expected number of inversions given the number of breakpoints

被引:0
|
作者
Eriksen, N [1 ]
机构
[1] Royal Inst Technol, Dept Math, SE-10044 Stockholm, Sweden
来源
ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS | 2002年 / 2452卷
关键词
D O I
暂无
中图分类号
Q81 [生物工程学(生物技术)]; Q93 [微生物学];
学科分类号
071005 ; 0836 ; 090102 ; 100705 ;
摘要
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 occurred. 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.
引用
收藏
页码:316 / 330
页数:15
相关论文
共 50 条
  • [41] On the number of edges in graphs with a given connected domination number
    Sanchis, LA
    DISCRETE MATHEMATICS, 2000, 214 (1-3) : 193 - 210
  • [42] On the maximum number of edges in a hypergraph with given matching number
    Frankl, Peter
    DISCRETE APPLIED MATHEMATICS, 2017, 216 : 562 - 581
  • [43] ON THE NUMBER OF VERTICES OF RANDOM POLYHEDRA WITH A GIVEN NUMBER OF FACETS
    BUCHTA, C
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (01): : 85 - 92
  • [44] The asymptotic number of weighted partitions with a given number of parts
    Stark, Dudley
    RAMANUJAN JOURNAL, 2022, 57 (03): : 949 - 967
  • [45] The asymptotic number of weighted partitions with a given number of parts
    Dudley Stark
    The Ramanujan Journal, 2022, 57 : 949 - 967
  • [46] Maximizing the number of cliques in graphs with given matching number
    Duan, Xiuzhuan
    Ning, Bo
    Peng, Xing
    Wang, Jian
    Yang, Weihua
    DISCRETE APPLIED MATHEMATICS, 2020, 287 : 110 - 117
  • [47] The number of oriented rational links with a given deficiency number
    Diao, Yuanan
    Finney, Michael Lee
    Ray, Dawn
    JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, 2021, 30 (09)
  • [48] The number of subtrees in graphs with given number of cut edges
    Xu, Kexiang
    Li, Jie
    Wang, Hua
    DISCRETE APPLIED MATHEMATICS, 2021, 304 : 283 - 296
  • [49] Approximating the fixed linear crossing number
    Cimikowski, Robert
    Mumey, Brendan
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (17) : 2202 - 2210
  • [50] Approximating the Maximum Rectilinear Crossing Number
    Bald, Samuel
    Johnson, Matthew P.
    Liu, Ou
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 455 - 467