scientific article; zbMATH DE number 4126696

zbMATH Open0687.68024MaRDI QIDQ4206397FDOQ4206397

Authors: David Eppstein, Zvi Galil, R. Giancarlo 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

data structuresrecurrences

Mathematics Subject Classification ID

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

Cited In (6)

• Ask not what stringology can do for you: advances in pattern matching driven by computational biology
• Title not available (Why is that?)
• How hard is computing the edit distance?
• Title not available (Why is that?)
• How hard is to compute the edit distance
• Efficient algorithms for molecular sequence analysis.

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)