On the public citation graph

On the Cost of Interchange Rearrangement in Strings

https://doi.org/10.1137/080712969
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0304-3975(85)90047-7openalex-snapshot
The complexity of finding minimum-length generator sequences
inferredcites →https://doi.org/10.1016/j.dam.2004.04.010openalex-snapshot
A very elementary presentation of the Hannenhalli–Pevzner theory
inferredcites →https://doi.org/10.1016/s0020-0190(96)00155-xopenalex-snapshot
Sorting permutations by block-interchanges
inferredcites →https://doi.org/10.1016/s0166-218x(96)00061-3openalex-snapshot
Polynomial-time algorithm for computing translocation distance between genomes
inferredcites →https://doi.org/10.1017/cbo9780511703676.073openalex-snapshot
Note on the Theory of Permutations
inferredcites →https://doi.org/10.1051/jphystap:019000090061801openalex-snapshot
Philosophical Magazine
inferredcites →https://doi.org/10.1089/106652703322539097openalex-snapshot
Sorting by Short Swaps
inferredcites →https://doi.org/10.1137/0210054openalex-snapshot
The NP-Completeness of Some Edge-Partition Problems
inferredcites →https://doi.org/10.1137/s0895480103433550openalex-snapshot
Reversals and Transpositions Over Finite Alphabets
inferredcites →https://doi.org/10.1137/s089548019528280xopenalex-snapshot
Sorting by Transpositions
inferredcites →https://doi.org/10.1137/s089548019731994xopenalex-snapshot
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/300515.300516openalex-snapshot
Transforming cabbage into turnip
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.5555/1109557.1109692openalex-snapshot
Pattern matching with address errors: rearrangement distances
inferredcites →https://doi.org/10.5555/982792.982930openalex-snapshot
Improved bounds on sorting with length-weighted reversals

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4090455openalex-extracted
Exploiting Pseudo-Locality of Interchange Distance
inferred← citeshttps://doi.org/10.1007/978-3-030-86692-1_19openalex-snapshot
Exploiting Pseudo-locality of Interchange Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_1openalex-snapshot
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_1openalex-snapshot
String Rearrangement Metrics: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_41openalex-snapshot
Approximate String Matching with Stuck Address Bits
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105324openalex-snapshot
Exploiting pseudo-locality of interchange distance
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.009openalex-snapshot
The transposition median problem is NP-complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.044openalex-snapshot
Approximate string matching with stuck address bits
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.002openalex-snapshot
Using swaps and deletes to make strings match
inferred← citeshttps://doi.org/10.1186/s40537-025-01227-1openalex-snapshot
A guide to similarity measures and their data science applications
inferred← citeshttps://doi.org/10.2478/v10065-009-0001-4openalex-snapshot
Transposition Rearrangement: Linear Algorithm for Length-Cost Model
inferred← citeshttps://doi.org/10.46298/dmtcs.8383openalex-snapshot
Token Swapping on Trees
inferred← citeshttps://doi.org/10.70675/4303476fzea42z4d77zab40z685972eb85dcopenalex-snapshot
Weighted Genome Rearrangements
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.