On sorting by 3-bounded transpositions (Q2497524): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.06.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2178772003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting a bridge hand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by bounded block-moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by short block-moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:33, 24 June 2024

scientific article
Language Label Description Also known as
English
On sorting by 3-bounded transpositions
scientific article

    Statements

    Identifiers