-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathgsw.h
38 lines (28 loc) · 801 Bytes
/
gsw.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
/*
* gsw.h
* glia
*
* Created by Deniz Kural.
* Copyright 2011 Deniz Kural. All rights reserved.
*
*/
#ifndef GSW_H
#define GSW_H
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include "gliamodels.h"
#include "nodealign.h"
#include "traceback.h"
// struct cmp_parent_depths;
/* Return the topological order of a node in a DAG
Check if it has depth, if so don't repeat the backtrack
Else, check if it has a parent node, if so recurse
Otherwise declare the node to be a head node */
int getDepth(sn* node);
sn* sequenceDagAlign(std::string sequence, std::vector<sn*> nlist, int maxdepth,
const int match, const int mism, const int gap);
sn* gsw(std::string read, std::vector<sn*> nlist,
const int match, const int mism, const int gap);
#endif