File: loadgenome.hpp

package info (click to toggle)
sortmerna 4.3.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 134,048 kB
  • sloc: cpp: 24,424; ansic: 15,923; python: 1,453; sh: 224; makefile: 31
file content (78 lines) | stat: -rw-r--r-- 2,583 bytes parent folder | download | duplicates (3)
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
/*
 @copyright 2016-2021  Clarity Genomics BVBA
 @copyright 2012-2016  Bonsai Bioinformatics Research Group
 @copyright 2014-2016  Knight Lab, Department of Pediatrics, UCSD, La Jolla

 @parblock
 SortMeRNA - next-generation reads filter for metatranscriptomic or total RNA
 This is a free software: you can redistribute it and/or modify
 it under the terms of the GNU Lesser General Public License as published by
 the Free Software Foundation, either version 3 of the License, or
 (at your option) any later version.

 SortMeRNA 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 Lesser General Public License for more details.

 You should have received a copy of the GNU Lesser General Public License
 along with SortMeRNA. If not, see <http://www.gnu.org/licenses/>.
 @endparblock

 @contributors Jenya Kopylova   jenya.kopylov@gmail.com
			   Laurent No      laurent.noe@lifl.fr
			   Pierre Pericard  pierre.pericard@lifl.fr
			   Daniel McDonald  wasade@gmail.com
			   Mikal Salson    mikael.salson@lifl.fr
			   Hlne Touzet    helene.touzet@lifl.fr
			   Rob Knight       robknight@ucsd.edu
*/

#include "paralleltraversal.hpp"
#include <queue>

#ifndef minoccur_h
#define minoccur_h

/*
 *
 * FUNCTION 	: void find_minoccur   ( int minlenread )
 * PURPOSE	: find the minimum possible occurrence of a k-mer in the database for which a parallel
 *		  traversal of the universal Levenshtein automaton and the Burst trie is carried out 	  
 *
 **************************************************************************************************************/
void find_minoccur ( int );

#ifdef WINDOWS
/*
 *
 * FUNCTION 	: int isnewline   ( char *ch )
 * PURPOSE	: parse '\n', '\r' or '\r\n' newlines
 * PARAMETERS	: pointer to character being observed	  
 *
 **************************************************************************************************************/
int isnewline( char *ch );
#endif

/* rRNA database file (fasta) */
extern char *rrnadbfile;

/* the minimum number of occurrences of an s/2-mer hash id in the rrna database */
extern unsigned int MINOCCUR;

/* maximum/minimum length of an rRNA sequence in the database */
extern int maxlen;
extern int minlen;

/* the number of rRNAs in the rRNA database */
extern int rrnastrings;

extern unsigned int mask32;
extern char map_nt[122];

extern hashid *kmerf;
extern hashid *kmerr;


#endif