scientific article; zbMATH DE number 2119725
From MaRDI portal
Publication:4828999
zbMath1093.68638MaRDI QIDQ4828999
No author found.
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Approximate consistency for transformations on words and trees ⋮ Approximating tree edit distance through string edit distance ⋮ \(L_{1}\) pattern matching lower bound ⋮ Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem ⋮ Approximating reversal distance for strings with bounded number of duplicates ⋮ Minimum common string partition revisited ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ Genomic Scaffold Filling: A Progress Report ⋮ Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling ⋮ Edit distance with move operations ⋮ Quick Greedy Computation for Minimum Common String Partitions ⋮ Sorting by Transpositions Is Difficult ⋮ Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics ⋮ Improved output-sensitive snap rounding ⋮ Nonembeddability theorems via Fourier analysis ⋮ Quick greedy computation for minimum common string partition ⋮ Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity ⋮ Distance measures for biological sequences: some recent approaches ⋮ Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ The greedy algorithm for edit distance with moves ⋮ A 1.5-approximation algorithm for two-sided scaffold filling
This page was built for publication:
