File tree Expand file tree Collapse file tree 4 files changed +34
-25
lines changed Expand file tree Collapse file tree 4 files changed +34
-25
lines changed Original file line number Diff line number Diff line change 8
8
9
9
version_json = '''
10
10
{
11
- "date": "2022-03-31T19:57:19 +0200",
12
- "dirty": true ,
11
+ "date": "2022-04-11T12:12:59 +0200",
12
+ "dirty": false ,
13
13
"error": null,
14
- "full-revisionid": "1dd1190c2db1975140823836653618bcbfc812e8 ",
15
- "version": "2.2.3+13.g1dd1190.dirty "
14
+ "full-revisionid": "d729f215e555404d7c7213d5c172677002ebdafb ",
15
+ "version": "2.2.3+15.gd729f21 "
16
16
}
17
17
''' # END VERSION_JSON
18
18
Original file line number Diff line number Diff line change @@ -124,18 +124,27 @@ def add_arguments(parser):
124
124
125
125
126
126
def longest_common_substring (s1 , s2 ):
127
- m = [[0 ] * (1 + len (s2 )) for i in range (1 + len (s1 ))]
128
- longest , x_longest = 0 , 0
129
- for x in range (1 , 1 + len (s1 )):
130
- for y in range (1 , 1 + len (s2 )):
131
- if s1 [x - 1 ] == s2 [y - 1 ]:
132
- m [x ][y ] = m [x - 1 ][y - 1 ] + 1
133
- if m [x ][y ] > longest :
134
- longest = m [x ][y ]
135
- x_longest = x
136
- else :
137
- m [x ][y ] = 0
138
- return s1 [x_longest - longest : x_longest ]
127
+ m = []
128
+ for i , letter in enumerate (list (s1 )):
129
+ if letter == list (s2 )[i ]:
130
+ m .append (letter )
131
+ else :
132
+ break
133
+ return '' .join (m )
134
+
135
+ # def longest_common_substring(s1, s2):
136
+ # m = [[0] * (1 + len(s2)) for i in range(1 + len(s1))]
137
+ # longest, x_longest = 0, 0
138
+ # for x in range(1, 1 + len(s1)):
139
+ # for y in range(1, 1 + len(s2)):
140
+ # if s1[x - 1] == s2[y - 1]:
141
+ # m[x][y] = m[x - 1][y - 1] + 1
142
+ # if m[x][y] > longest:
143
+ # longest = m[x][y]
144
+ # x_longest = x
145
+ # else:
146
+ # m[x][y] = 0
147
+ # return s1[x_longest - longest: x_longest]
139
148
140
149
def read_count (input ):
141
150
# Use bash command to count the read number
Original file line number Diff line number Diff line change 1
- {% set version = "2.1.0 " %}
1
+ {% set version = "2.2.6 " %}
2
2
3
3
package :
4
4
name : secapr
5
5
version : {{ version }}
6
6
7
7
source :
8
8
url : https://github.com/AntonelliLab/seqcap_processor/archive/v{{ version }}.tar.gz
9
- sha256 : bc69147dbc452acf56dc75452c5cadcdaeeeda1d0a3a81c5c3667e0018924031
9
+ sha256 : 63a67d6bc5d139b2910e562dc7969e7c8374c01720af5319a0f7a9d06c5983c0
10
10
11
11
build :
12
12
noarch : generic
@@ -17,24 +17,24 @@ build:
17
17
18
18
requirements :
19
19
host :
20
- - python 3.7
20
+ - python
21
21
- pip
22
22
23
23
run :
24
- - python
24
+ - python=3.8
25
25
- pandas
26
26
- matplotlib-base
27
- - biopython=1.76
27
+ - biopython
28
28
- trimmomatic
29
29
- fastqc
30
- - abyss
31
- - spades
30
+ - fastp=0.23
31
+ - spades=3.15.2
32
32
- blast
33
33
- mafft
34
34
- muscle
35
35
- emboss
36
36
- bwa
37
- - samtools=1.9
37
+ - samtools==1.3.1
38
38
- trimal
39
39
40
40
test :
Original file line number Diff line number Diff line change 1
1
Metadata-Version: 2.1
2
2
Name: secapr
3
- Version: 2.2.3+13.g1dd1190.dirty
3
+ Version: 2.2.3+15.gd729f21
4
4
Summary: Process sequence-capture fastq files into alignments for phylogenetic analyses
5
5
Home-page: https://github.com/AntonelliLab/seqcap_processor
6
6
Author: Tobias Andermann
You can’t perform that action at this time.
0 commit comments