2015
DOI: 10.1007/978-3-319-16483-0_48
|View full text |Cite
|
Sign up to set email alerts
|

A Unified Integer Programming Model for Genome Rearrangement Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…Therefore, the program arbitrarily chooses one possibility among them when it enumerates a succession of equivalent transpositions or inversions. The sorting problem solved by the backtracking algorithm presented here has already been studied by several authors using the Integer Linear Programming framework [ 44 , 45 ].…”
Section: Methodsmentioning
confidence: 99%
“…Therefore, the program arbitrarily chooses one possibility among them when it enumerates a succession of equivalent transpositions or inversions. The sorting problem solved by the backtracking algorithm presented here has already been studied by several authors using the Integer Linear Programming framework [ 44 , 45 ].…”
Section: Methodsmentioning
confidence: 99%