Sorting by bounded block-moves (Q1281770)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Sorting by bounded block-moves	scientific article

Statements

scholarly article

0 references

Sorting by bounded block-moves (English)

0 references

Discrete Applied Mathematics

0 references

publication date

29 November 1999

0 references

zbMATH Keywords

sorting

0 references

computational biology

0 references

Lenwood S. Heath

0 references

John Paul C. Vergara

0 references

MaRDI profile type

MaRDI publication profile

0 references

Sorting by insertion of leading elements

0 references

Sorting by Transpositions

0 references

Genome Rearrangements and Sorting by Reversals

0 references

Sorting Permutations by Reversals and Eulerian Cycle Decompositions

0 references

Sorting with fixed-length reversals

0 references

The minimum-length generator sequence problem is NP-hard

0 references

Sorting by short block-moves

0 references

The complexity of finding minimum-length generator sequences

0 references

A priority queue in which initialization and queue operations takeO(loglogD) time

0 references

Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

0 references

Transitive Orientation of Graphs and Identification of Permutation Graphs

0 references

Circular permutation graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0166-218X(98)00072-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1281770

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1281770&oldid=34215301"