-
Notifications
You must be signed in to change notification settings - Fork 24
/
assembler.h
81 lines (67 loc) · 1.94 KB
/
assembler.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/* PANDAseq -- Assemble paired FASTQ Illumina reads and strip the region between amplification primers.
Copyright (C) 2011-2012 Andre Masella
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef ASM_H
# define ASM_H
# include "config.h"
# include "pandaseq.h"
# include "misc.h"
# ifdef HAVE_PTHREAD
# include <pthread.h>
# endif
struct panda_assembler {
volatile size_t refcnt;
MANAGED_MEMBER(
PandaNextSeq,
next);
MANAGED_MEMBER(
PandaFailAlign,
noalgn);
PandaLogProxy logger;
size_t *rejected;
PandaModule *modules;
size_t modules_length;
size_t modules_size;
double threshold;
size_t minoverlap;
size_t maxoverlap;
seqindex *kmerseen;
size_t num_kmers;
PandaAlgorithm algo;
panda_result_seq result;
size_t forward_primer_length;
size_t reverse_primer_length;
size_t forward_trim;
size_t reverse_trim;
long nofpcount;
long norpcount;
long okcount;
long lowqcount;
long degencount;
long noalgncount;
long badreadcount;
long slowcount;
long count;
bool post_primers;
# ifdef HAVE_PTHREAD
pthread_mutex_t mutex;
# endif
panda_nt forward_primer[MAX_LEN];
panda_nt reverse_primer[MAX_LEN];
panda_result result_seq[2 * MAX_LEN];
long overlapcount[2 * MAX_LEN];
size_t longest_overlap;
char name[MAX_LEN];
double primer_penalty;
};
#endif