|
| Correction: versatile and declarative dynamic programming using pair algebrasFaculty of Technology, Bielefeld University, Postfach 10 01 31, 33501 Bielefeld, Germany
BMC Bioinformatics 2006, 7:214doi:10.1186/1471-2105-7-214 The electronic version of this article is the complete one and can be found online at: http://www.biomedcentral.com/1471-2105/7/214
©
2006 Steffen and Giegerich; licensee BioMed Central Ltd. CorrectionWe have located a typesetting error in our recent publication in BMC Bioinformatics 2005,6:224 [1]. Although the error is quite minor (l' = l has been miswritten as l' ∈ L), it occurs in the central Definition 3 in the paper, and is also pasted into subsequent example code (both error sites on p.7, right column). This error unfortunately looks mathematically plausible, although it is in contradiction with the given verbal explanations. The corrected Definition 3 now reads as: Definition 3 (Product operation on evaluation algebras) Let M and N be evaluation algebras over Σ. Their product M***N is an evaluation algebra over Σ and has the functions fM***N ((m1, n1)...(mk, nk)) = (fM (m1,...,mk), fN(n1,...,nk)) for each f in Σ, and the objective function hM***N([(m1, n1)...(mk, nk)]) = [(l, r)| l ∈ L, r ← hN([r'|(l', r') ← [(m1, n1)...(mk, nk)], l' = l])], where L = hM ([m1,...,nk]). References
Have something to say? Post a comment on this article! |




on Google Scholar







author email
corresponding author email