File: Contigs.cpp

package info (click to toggle)
abyss 2.3.10-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 8,284 kB
  • sloc: cpp: 78,182; ansic: 6,512; makefile: 2,252; perl: 672; sh: 509; haskell: 412; python: 4
file content (258 lines) | stat: -rw-r--r-- 6,740 bytes parent folder | download | duplicates (2)
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
#include "Contigs.h"

#include <cassert>
#include <fstream>
#include <iostream>
#include <sstream>

Graph g_contigGraph;
std::vector<std::string> g_contigComments;
ContigSequences g_contigSequences;

int
distanceBetween(const ContigNode& node1, const ContigNode& node2)
{
	return get(edge_bundle, g_contigGraph, node1, node2).distance;
}

const ContigSequence&
getContigSequence(const ContigNode& node)
{
	const unsigned int idx = node.index();
	assert(idx < g_contigSequences.size());
	return g_contigSequences[idx];
}

int
getContigSize(const ContigNode& node)
{
	return getContigSequence(node).size();
}

const std::string&
getContigComment(const ContigNode& node)
{
	const unsigned int id = node.id();
	assert(id < g_contigComments.size());
	return g_contigComments[id];
}

Sequence
getPathSequence(const ContigPath& path)
{
	assert(path.size() >= 1);
	Sequence sequence = Sequence(getContigSequence(path[0]));
	for (size_t i = 1; i < path.size(); i++) {
		const auto& node = path[i];
		const auto distance = distanceBetween(path[i - 1], path[i]);
		const auto overlap = -distance;
		assert(overlap >= 0);
		Sequence newSequence = Sequence(getContigSequence(node));
		assert(int(sequence.size()) >= overlap);
		assert(int(newSequence.size()) >= overlap);
		assert(sequence.substr(sequence.size() - overlap) == newSequence.substr(0, overlap));
		sequence += newSequence.substr(overlap);
	}
	return sequence;
}

Sequence
getPathSequence(const ImaginaryContigPath& path)
{
	assert(path.size() >= 1);
	Sequence sequence = Sequence(getContigSequence(path[0].first));
	for (size_t i = 1; i < path.size(); i++) {
		const auto& node = path[i].first;
		const auto& distance = path[i].second;
		const auto overlap = -distance;
		assert(overlap >= 0);
		Sequence newSequence = Sequence(getContigSequence(node));
		assert(int(sequence.size()) >= overlap);
		assert(int(newSequence.size()) >= overlap);
		assert(sequence.substr(sequence.size() - overlap) == newSequence.substr(0, overlap));
		sequence += newSequence.substr(overlap);
	}
	return sequence;
}

long
getContigNumOfKmers(const ContigNode& node)
{
	return get(vertex_bundle, g_contigGraph, node).coverage;
}

double
getContigBaseCoverage(const ContigNode& node)
{
	return double(getContigNumOfKmers(node)) * opt::k /
	       double(getContigSequence(node).size() - opt::k + 1);
}

void
loadContigGraph(const std::string& contigGraphPath)
{
	if (opt::verbose)
		std::cerr << "Loading contig graph from `" << contigGraphPath << "'...\n";
	std::ifstream fin(contigGraphPath);
	assert_good(fin, contigGraphPath);
	fin >> g_contigGraph;
	assert(fin.eof());
	g_contigNames.lock();
	if (opt::verbose) {
		std::cerr << "Contig graph loaded.\n";
		printGraphStats(std::cerr, g_contigGraph);
	}
}

void
loadContigs(const std::string& contigsPath)
{
	if (opt::verbose)
		std::cerr << "Loading contigs from `" << contigsPath << "'...\n";
	FastaReader in(contigsPath.c_str(), FastaReader::NO_FOLD_CASE);
	for (FastaRecord rec; in >> rec;) {
		if (g_contigNames.count(rec.id) == 0)
			continue;
		assert(g_contigSequences.size() / 2 == get(g_contigNames, rec.id));
		g_contigComments.push_back(rec.comment);
		g_contigSequences.push_back(rec.seq);
		g_contigSequences.push_back(reverseComplement(rec.seq));
	}
	assert(in.eof());
	assert(!g_contigSequences.empty());
	opt::colourSpace = isdigit(g_contigSequences.front()[0]);
	if (opt::verbose) {
		std::cerr << "Contigs loaded.\n";
	}
}

void
storeContigGraph(
    const std::string& contigGraphPath,
    const std::string& program,
    const std::string& commandLine)
{
	if (opt::verbose) {
		std::cerr << "Storing contig graph to `" << contigGraphPath << "'...\n";
	}
	std::ofstream fout(contigGraphPath.c_str());
	assert_good(fout, contigGraphPath);
	write_graph(fout, g_contigGraph, program, commandLine);
	assert_good(fout, contigGraphPath);
	if (opt::verbose) {
		std::cerr << "Contig graph stored.\n";
	}
}

void
storeContigs(const std::string& contigsPath)
{
	if (opt::verbose) {
		std::cerr << "Storing contigs to `" << contigsPath << "'...\n";
	}
	std::ofstream fout(contigsPath.c_str());
	assert_good(fout, contigsPath);

	Graph::vertex_iterator vertexStart, vertexEnd;
	boost::tie(vertexStart, vertexEnd) = vertices(g_contigGraph);
	for (auto it = vertexStart; it != vertexEnd; ++it) {
		auto node = *it;
		if (!get(vertex_removed, g_contigGraph, node) && !node.sense()) {
			FastaRecord rec;

			std::stringstream ss;
			ss << get(vertex_name, g_contigGraph, node);
			std::string name = ss.str();

			rec.id = name.substr(0, name.size() - 1);
			rec.comment = getContigComment(node);
			rec.seq = getContigSequence(node);

			fout << rec;
		}
	}
	assert_good(fout, contigsPath);
	if (opt::verbose) {
		std::cerr << "Contigs stored.\n";
	}
}

unsigned
numVerticesRemoved(const Graph& graph)
{
	unsigned removed = 0;
	Graph::vertex_iterator vertexStart, vertexEnd;
	boost::tie(vertexStart, vertexEnd) = vertices(graph);
	for (auto it = vertexStart; it != vertexEnd; ++it) {
		auto node = *it;
		if (get(vertex_removed, graph, node)) {
			removed++;
		}
	}
	return removed;
}

void
assembleContigs()
{
	if (opt::verbose) {
		std::cerr << "Assembling contigs... ";
	}

	std::vector<std::string> pathIDs;
	ContigPaths paths;

	Graph newContigGraph(g_contigGraph);
	assemble(newContigGraph, back_inserter(paths));
	assert(num_vertices(newContigGraph) >= num_vertices(g_contigGraph));

	// Record all the contigs that are in a path.
	std::vector<bool> seen(g_contigGraph.num_vertices() / 2);

	g_contigNames.unlock();
	int counter = 0;
	for (const auto& path : paths) {
		assert(!path.empty());
		ContigNode pathNode(g_contigGraph.num_vertices() / 2 + counter, path[0].sense());
		std::string name = createContigName();
		pathIDs.push_back(name);
		put(vertex_name, newContigGraph, pathNode, name);
		for (const auto& node : path) {
			seen[node.id()] = true;
		}
		counter++;
	}
	g_contigNames.lock();

	for (const auto& path : paths) {
		assert(!path.empty());
		Sequence sequence = getPathSequence(path);
		unsigned coverage = 0;
		for (const auto& node : path) {
			if (!node.ambiguous()) {
				coverage += g_contigGraph[node].coverage;
			}
		}

		std::stringstream ss;
		ss << sequence.size() << ' ' << coverage << ' ';
		ss << get(vertex_name, g_contigGraph, path.front());
		if (path.size() == 1)
			return;
		else if (path.size() == 3)
			ss << ',' << get(vertex_name, g_contigGraph, path[1]);
		else if (path.size() > 3)
			ss << ",...";
		ss << ',' << get(vertex_name, g_contigGraph, path.back());

		g_contigSequences.push_back(sequence);
		g_contigSequences.push_back(reverseComplement(sequence));
		g_contigComments.push_back(ss.str());
	}

	g_contigGraph.swap(newContigGraph);

	if (opt::verbose) {
		std::cerr << "Done!\n";
	}
}