@@ -3,11 +3,11 @@ category: Algorithms
3
3
build-type : Simple
4
4
5
5
name : efficient-implied-alignment
6
- version : 0.1 .0
6
+ version : 1.0 .0
7
7
8
8
author : Alex Washburn
9
9
10
- copyright : 2018 Alex Washburn
10
+ copyright : 2020 Alex Washburn
11
11
license : BSD-3-Clause
12
12
license-file : LICENSE
13
13
@@ -16,21 +16,21 @@ synopsis: Proof of concept of efficient multiple string alignment
16
16
description : Using a commutative, binary string alignment operator and a
17
17
binary tree with strings on the leaf nodes, we can efficiently
18
18
derive the a multiple string alignment of the implied by the
19
- binary tree. Requires a pot -order then preorder traversal.
19
+ binary tree. Requires a post -order then preorder traversal.
20
20
Post-order traversal should be worst case /O(n*k^2)/, average
21
21
case /O(n*k*log(k))/ and the pre-order traversal should be
22
22
/O(n*k)/.
23
23
24
- homepage : https://github.com/githubuser /efficient-implied-alignment#readme
25
- bug-reports : https://github.com/githubuser /efficient-implied-alignment/issues
24
+ homepage : https://github.com/recursion-ninja /efficient-implied-alignment#readme
25
+ bug-reports : https://github.com/recursion-ninja /efficient-implied-alignment/issues
26
26
27
27
extra-source-files :
28
28
ChangeLog.md
29
29
README.md
30
30
31
31
source-repository head
32
32
type : git
33
- location : https://github.com/githubuser /efficient-implied-alignment
33
+ location : https://github.com/recursion-ninja /efficient-implied-alignment
34
34
35
35
36
36
-- A litany of GHC warnings designed to alert us during the build of any common
@@ -94,15 +94,13 @@ library
94
94
base >= 4.7 && < 5
95
95
, bimap
96
96
, case-insensitive
97
- -- >=0.5.8 Required for Data.Map.restrictKeys
98
97
, containers >= 0.5.8
99
98
, deepseq
100
99
, dlist
101
100
, hashable
102
101
, integer-gmp
103
102
, keys
104
103
, lens
105
- -- , matrix
106
104
, matrices
107
105
, megaparsec >= 8.0
108
106
, monad-loops
@@ -118,7 +116,6 @@ library
118
116
, transformers
119
117
, validation
120
118
, vector
121
- -- >=3.4 required for corrected definition of (!) & index
122
119
, vector-instances >= 3.4
123
120
124
121
exposed-modules :
@@ -129,7 +126,6 @@ library
129
126
Data.BTree
130
127
Data.Decoration
131
128
Data.DecTree
132
- -- Data.Matrix.ZeroIndexed
133
129
Data.SymbolString
134
130
Data.TCM
135
131
Data.UserInput
0 commit comments