scientific article; zbMATH DE number 910858
From MaRDI portal
Publication:4886031
zbMath0849.68021MaRDI QIDQ4886031
Publication date: 4 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)
Related Items (7)
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended ⋮ Co-linear chaining with overlaps and gap costs ⋮ Sequence to graph alignment using gap-sensitive co-linear chaining ⋮ Fast Algorithms for Computing Tree LCS ⋮ Local multiple alignment via subgraph enumeration ⋮ Fast algorithms for computing tree LCS ⋮ Chaining algorithms for multiple genome comparison
This page was built for publication: