String rearrangement metrics: a survey
DOI10.1007/978-3-642-12476-1_1zbMATH Open1284.68688OpenAlexW1501691050MaRDI QIDQ3558255FDOQ3558255
Authors: Amihood Amir, Avivit Levy 
Publication date: 4 May 2010
Published in: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_1
Recommendations
- Pattern matching with address errors: rearrangement distances
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- String matching with up to \(k\) swaps and mismatches
- Interchange rearrangement: the element-cost model
- On the Cost of Interchange Rearrangement in Strings
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Protein sequences, DNA sequences (92D20) Research exposition (monographs, survey articles) pertaining to biology (92-02) Algorithms on strings (68W32)
Cited In (7)
- On the hardness of the consensus string problem
- Weighted Minimum-Length Rearrangement Scenarios.
- Pattern matching with address errors: rearrangement distances
- Approximate string matching with stuck address bits
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- On the Cost of Interchange Rearrangement in Strings
- Exploiting pseudo-locality of interchange distance
This page was built for publication: String rearrangement metrics: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558255)
