Complexity and enumeration in models of genome rearrangement

被引：0

作者：

Bailey, Lora ^{[1
]}

Blake, Heather Smith ^{[2
]}

Cochran, Garner ^{[3
]}

Fox, Nathan ^{[4
]}

Levet, Michael ^{[5
]}

Mahmoud, Reem ^{[6
]}

Matson, Elizabeth Bailey ^{[7
]}

Singgih, Inne ^{[8
]}

Stadnyk, Grace ^{[9
]}

Wang, Xinyi ^{[10
]}

Wiedemann, Alexander ^{[11
]}

机构：

[1] Department of Mathematics, Grand Valley State University, Allendale,MI, United States

[2] Department of Mathematics and Computer Science, Davidson College, Davidson,NC, United States

[3] Department of Mathematics and Computer Science, Berry College, Mount Berry,GA, United States

[4] Department of Quantitative Sciences, Canisius University, Buffalo,NY, United States

[5] Department of Computer Science, College of Charleston, Charleston,SC, United States

[6] Division of Science, NYU Abu Dhabi, Abu Dhabi, United Arab Emirates

[7] The Division of Mathematics and Computer Science, Alfred University, Alfred,NY, United States

[8] Department of Mathematical Sciences, University of Cincinnati, Cincinnati,OH, United States

[9] Department of Mathematics, Furman University, Greenville,SC, United States

[10] Department of Computational Mathematics, Science, and Engineering, Michigan State University, East Lansing,MI, United States

[11] Department of Mathematics and Computational Data Science, Hamline University, Saint Paul,MN, United States

来源：

Theoretical Computer Science | 2024年 / 1022卷

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/j.tcs.2024.114880

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[31] Current theoretical models fail to predict the topological complexity of the human genome
Arsuaga, Javier
Jayasinghe, Reyka G.
Scharein, Robert G.
Segal, Mark R.
Stolz, Robert H.
Vazquez, Mariel
FRONTIERS IN MOLECULAR BIOSCIENCES, 2015, 2
[32] COMPLEXITY OF 3-DIMENSIONAL MANIFOLDS AND THEIR ENUMERATION IN THE ORDER OF COMPLEXITY INCREASE
MATVEEV, SV
DOKLADY AKADEMII NAUK SSSR, 1988, 301 (02): : 280 - 283
[33] Complexity Verification using Guided Theorem Enumeration
Srikanth, Akhilesh
Sahin, Burak
Harris, William R.
ACM SIGPLAN NOTICES, 2017, 52 (01) : 639 - 652
[34] Enumeration Complexity of Conjunctive Queries with Functional Dependencies
Nofar Carmeli
Markus Kröll
Theory of Computing Systems, 2020, 64 : 828 - 860
[35] TREE ENUMERATION AND TREE ALGORITHM COMPLEXITY COMPUTATION
王振宇
Science Bulletin, 1992, (23) : 2004 - 2009
[36] Enumeration results on the joint linear complexity of multisequences
Wang, Li-Ping
Niederreiter, Harald
FINITE FIELDS AND THEIR APPLICATIONS, 2006, 12 (04) : 613 - 637
[37] Enumeration of the Monomials of a Polynomial and Related Complexity Classes
Stiozecki, Yann
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 629 - 640
[38] Enumeration Complexity of Conjunctive Queries with Functional Dependencies
Carmeli, Nofar
Kroell, Markus
THEORY OF COMPUTING SYSTEMS, 2020, 64 (05) : 828 - 860
[39] Subgraph Enumeration in Optimal I/O Complexity
Deng, Shiyuan
Tao, Yufei
27TH INTERNATIONAL CONFERENCE ON DATABASE THEORY, ICDT 2024, 2024, 290
[40] Improving I/O Complexity of Triangle Enumeration
Cui, Yi
Xiao, Di
Cline, Daren B. H.
Loguinov, Dmitri
2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2017, : 61 - 70

← 1 2 3 4 5 →