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 条

[1] Complexity and Enumeration in Models of Genome Rearrangement
Bailey, Lora
Blake, Heather Smith
Cochran, Garner
Fox, Nathan
Levet, Michael
Mahmoud, Reem
Matson, Elizabeth Bailey
Singgih, Inne
Stadnyk, Grace
Wang, Xinyi
Wiedemann, Alexander
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14422 LNCS : 3 - 14
[2] Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement
Kovacevic, Mladen
Brdar, Sanja
Crnojevic, Vladimir
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 927 - 931
[3] ENUMERATION COMPLEXITY
Erlebach, Thomas
Strozecki, Yann
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2019, 2019 (129): : 21 - 53
[4] A new algebraic approach to genome rearrangement models
Terauds, Venta
Sumner, Jeremy
JOURNAL OF MATHEMATICAL BIOLOGY, 2022, 84 (06)
[5] The complexity of genome rearrangement combinatorics under the infinite sites model
Greenman, Chris D.
Penso-Dolfin, Luca
Wu, Taoyang
JOURNAL OF THEORETICAL BIOLOGY, 2020, 501
[6] Models and Algorithms for Genome Rearrangement with Positional Constraints
Swenson, Krister M.
Blanchette, Mathieu
ALGORITHMS IN BIOINFORMATICS (WABI 2015), 2015, 9289 : 243 - 256
[7] Models and algorithms for genome rearrangement with positional constraints
Krister M. Swenson
Pijus Simonaitis
Mathieu Blanchette
Algorithms for Molecular Biology, 11
[8] A new algebraic approach to genome rearrangement models
Venta Terauds
Jeremy Sumner
Journal of Mathematical Biology, 2022, 84
[9] Models and algorithms for genome rearrangement with positional constraints
Swenson, Krister M.
Simonaitis, Pijus
Blanchette, Mathieu
ALGORITHMS FOR MOLECULAR BIOLOGY, 2016, 11
[10] Signed genome rearrangement by reversals and transpositions: models and approximations
Lin, GH
Xue, GL
THEORETICAL COMPUTER SCIENCE, 2001, 259 (1-2) : 513 - 531

← 1 2 3 4 5 →