Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
S
sumaclust
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Commits
Issue Boards
Open sidebar
OBITools
sumaclust
Commits
4f6121c2
Commit
4f6121c2
authored
Oct 13, 2017
by
Celine Mercier
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Version 1.0.30 (changes in sumalibs)
parent
fcb9dbcf
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
4 deletions
+3
-4
sumaclust.c
sumaclust.c
+3
-4
No files found.
sumaclust.c
View file @
4f6121c2
...
...
@@ -23,7 +23,7 @@
#include "mtcompare_sumaclust.h"
#include "sumaclust.h"
#define VERSION "1.0.
2
0"
#define VERSION "1.0.
3
0"
/* ----------------------------------------------- */
...
...
@@ -585,7 +585,7 @@ void putSeqInCluster(fastaSeqPtr* seq, fastaSeqPtr* center, double score)
}
int
compare
(
fastaSeqPtr
*
db
,
int
n
,
BOOL
fastOption
,
double
threshold
,
BOOL
normalize
,
int
reference
,
BOOL
lcsmode
,
int
compare
(
fastaSeqPtr
*
db
,
int
n
,
BOOL
fastOption
,
double
threshold
,
BOOL
normalize
,
int
reference
,
BOOL
lcsmode
,
double
max_ratio
)
{
double
score
;
...
...
@@ -723,7 +723,7 @@ int compare(fastaSeqPtr* db, int n, BOOL fastOption, double threshold, BOOL nor
free
(
iseq1
-
sizeForSeqs
+
lmax
);
free
(
iseq2
-
sizeForSeqs
+
lmax
);
if
(
normalize
&&
reference
==
ALILEN
)
if
(
normalize
&&
(
reference
==
ALILEN
)
)
free
(
address
);
return
(
k
);
...
...
@@ -1037,7 +1037,6 @@ int main(int argc, char** argv)
// FASTA file
if
(
printFASTA
)
{
if
(
printFASTAtofile
)
{
FASTA_output
=
fopen
(
FASTA_file_name
,
"w"
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment