scientific article; zbMATH DE number 4126696

MaRDI QIDQ4206397zbMATH OpenFDO

Authors David Eppstein, Zvi Galil, R. Giancarlo

Publication date 1990

zbMATH Keywords

data structuresrecurrences

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 826057
• Speeding up dynamic programming with applications to molecular biology
• Efficient algorithms for molecular sequence analysis.
• Algorithms on Strings, Trees and Sequences
• Sparse dynamic programming II

Cited in

(8)

• How hard is computing the edit distance?
• scientific article; zbMATH DE number 432798 (Why is no real title available?)
• Efficient algorithms for molecular sequence analysis.
• Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
• scientific article; zbMATH DE number 826057 (Why is no real title available?)
• How hard is to compute the edit distance
• Edit distance of finite state transducers
• Ask not what stringology can do for you: advances in pattern matching driven by computational biology

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206397)