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
|
/*
* The MIT License
*
* Wavefront Alignment Algorithms
* Copyright (c) 2017 by Santiago Marco-Sola <santiagomsola@gmail.com>
*
* This file is part of Wavefront Alignment Algorithms.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
* PROJECT: Wavefront Alignment Algorithms
* AUTHOR(S): Santiago Marco-Sola <santiagomsola@gmail.com>
* DESCRIPTION: Gap-linear alignment algorithms wrapper
*/
#include "benchmark/benchmark_gap_linear.h"
#include "benchmark/benchmark_check.h"
#include "wavefront/wavefront_align.h"
#include "gap_linear/nw.h"
/*
* Benchmark NW
*/
void benchmark_gap_linear_nw(
align_input_t* const align_input,
linear_penalties_t* const penalties) {
// Allocate
score_matrix_t score_matrix;
score_matrix_allocate(
&score_matrix,align_input->pattern_length+1,
align_input->text_length+1,align_input->mm_allocator);
cigar_t* const cigar = cigar_new(
align_input->pattern_length+align_input->text_length,
align_input->mm_allocator);
// Align
timer_start(&align_input->timer);
nw_align(&score_matrix,penalties,
align_input->pattern,align_input->pattern_length,
align_input->text,align_input->text_length,cigar);
timer_stop(&align_input->timer);
// DEBUG
if (align_input->debug_flags) {
benchmark_check_alignment(align_input,cigar);
}
// Output
if (align_input->output_file) {
benchmark_print_output(align_input,gap_linear,false,cigar);
}
// Free
score_matrix_free(&score_matrix);
cigar_free(cigar);
}
void benchmark_gap_linear_wavefront(
align_input_t* const align_input,
linear_penalties_t* const penalties) {
// Parameters
wavefront_aligner_t* const wf_aligner = align_input->wf_aligner;
// Align
timer_start(&align_input->timer);
wavefront_align(wf_aligner,
align_input->pattern,align_input->pattern_length,
align_input->text,align_input->text_length);
timer_stop(&align_input->timer);
// DEBUG
if (align_input->debug_flags) {
benchmark_check_alignment(align_input,wf_aligner->cigar);
}
// Output
if (align_input->output_file) {
const int score_only = (wf_aligner->alignment_scope == compute_score);
benchmark_print_output(align_input,gap_linear,score_only,wf_aligner->cigar);
}
}
|
