Reversals and transpositions over finite alphabets

被引：34

作者：

Radcliffe, AJ ^{[1
]}

Scott, AD

Wilmer, EL

机构：

[1] Univ Nebraska, Dept Math, Lincoln, NE 68588 USA

[2] UCL, Dept Math, London WC1E 6BT, England

[3] Oberlin Coll, Dept Math, Oberlin, OH 44074 USA

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2005年 / 19卷 / 01期

关键词：

strings; sorting; genome comparison; reversals; transpositions; NP-complete problems; MAX-SNP hardness; approximation algorithms;

D O I：

10.1137/S0895480103433550

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or signed reversal distance between two strings over a finite alphabet is NP-hard, while for "dense" instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as well as investigating the distance between random strings and the problem of sorting a string over a finite alphabet.

引用

页码：224 / 244

页数：21

共 50 条

[41] Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
Czyba, Christopher
Spinrath, Christopher
Thomas, Wolfgang
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 203 - 214
[42] Two approaches to the extension problem for arbitrary weights over finite module alphabets
Wood, Jay A.
Applicable Algebra in Engineering, Communications and Computing, 2021, 32 (03): : 427 - 455
[43] Two approaches to the extension problem for arbitrary weights over finite module alphabets
Jay A. Wood
Applicable Algebra in Engineering, Communication and Computing, 2021, 32 : 427 - 455
[44] A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Martin Bader
Mohamed I Abouelhoda
Enno Ohlebusch
BMC Bioinformatics, 9
[45] A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Bader, Martin
Abouelhoda, Mohamed I.
Ohlebusch, Enno
BMC BIOINFORMATICS, 2008, 9 (1)
[46] Constructing ρ/μ Approximations From Input/Output Snapshots for Systems Over Finite Alphabets
Tarraf, Danielle C.
2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 1504 - 1509
[47] On finite alphabets and infinite bases
Chen, Taolue
Fokkink, Wan
Luttik, Bas
Nain, Sumit
INFORMATION AND COMPUTATION, 2008, 206 (05) : 492 - 519
[48] MINIMAX CODES FOR FINITE ALPHABETS
RISSANEN, J
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (03) : 389 - 392
[49] Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes
Brito, Klairton Lima
Jean, Geraldine
Fertin, Guillaume
Oliveira, Andre Rodrigues
Dias, Ulisses
Dias, Zanoni
BIOINFORMATICS RESEARCH AND APPLICATIONS, ISBRA 2019, 2019, 11490 : 28 - 39
[50] Runtime Analysis of the (1+1) Evolutionary Algorithm on Strings Over Finite Alphabets
Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin
FOGA 11: PROCEEDINGS OF THE 2011 ACM/SIGEVO FOUNDATIONS OF GENETIC ALGORITHMS XI, 2011, : 119 - 126

← 1 2 3 4 5 →