diff options
Diffstat (limited to 'dev-haskell/lcs/metadata.xml')
| -rw-r--r-- | dev-haskell/lcs/metadata.xml | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/dev-haskell/lcs/metadata.xml b/dev-haskell/lcs/metadata.xml index fa121ce23df5..272873069bfc 100644 --- a/dev-haskell/lcs/metadata.xml +++ b/dev-haskell/lcs/metadata.xml @@ -4,15 +4,15 @@ <herd>haskell</herd> <longdescription> Provides a function lcs that takes two lists and returns a longest - common sublist. For example, lcs "abcd" "acbd" is either "abd" or - "acd". + common sublist. For example, lcs "abcd" "acbd" is either "abd" or + "acd". The package provides a simple, stupid and (most of all) slow implementation that needs, for inputs of length m and n, O(m+n) space and O((m+n)!) time in the worst case. It also provides an implementation of the Hunt-Szymanski LCS - algorithm, based on that in "String searching algorithms" by + algorithm, based on that in "String searching algorithms" by Graham A Stephen, ISBN 981021829X. Given inputs xs and ys of length m and n respectively, where there |