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 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
|
/*
* 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: WaveFront-Alignment module for display and report
*/
#include "utils/commons.h"
#include "system/mm_allocator.h"
#include "wavefront_display.h"
#include "wavefront_aligner.h"
#include "wavefront_compute.h"
/*
* Constants
*/
#define WF_DISPLAY_YLABEL_LENGTH 8
/*
* Compute dimensions
*/
int wavefront_display_compute_row_width(
const distance_metric_t distance_metric,
const int bt_length) {
// Compute number of components
int num_components = 1;
switch (distance_metric) {
case indel:
case edit:
case gap_linear: num_components = 1; break;
case gap_affine: num_components = 3; break;
case gap_affine_2p: num_components = 5; break;
default: break;
}
// Return
return ((num_components)*(4+(bt_length)));
}
void wavefront_display_compute_limits(
wavefront_aligner_t* const wf_aligner,
const int score_begin,
const int score_end,
int* const out_max_k,
int* const out_min_k) {
// Parameters
wavefront_components_t* const wf_components = &wf_aligner->wf_components;
const distance_metric_t distance_metric = wf_aligner->penalties.distance_metric;
// Compute min/max k
int i, max_k=INT_MIN, min_k=INT_MAX;
for (i=score_begin;i<=score_end;++i) {
const int s = (wf_components->memory_modular) ? i%wf_components->max_score_scope : i;
wavefront_t* const mwavefront = wf_components->mwavefronts[s];
if (mwavefront != NULL) {
max_k = MAX(max_k,mwavefront->hi);
min_k = MIN(min_k,mwavefront->lo);
}
if (distance_metric <= gap_linear) continue;
wavefront_t* const i1wavefront = wf_components->i1wavefronts[s];
if (i1wavefront != NULL) {
max_k = MAX(max_k,i1wavefront->hi);
min_k = MIN(min_k,i1wavefront->lo);
}
wavefront_t* const d1wavefront = wf_components->d1wavefronts[s];
if (d1wavefront != NULL) {
max_k = MAX(max_k,d1wavefront->hi);
min_k = MIN(min_k,d1wavefront->lo);
}
if (distance_metric == gap_affine) continue;
wavefront_t* const i2wavefront = wf_components->i2wavefronts[s];
if (i2wavefront != NULL) {
max_k = MAX(max_k,i2wavefront->hi);
min_k = MIN(min_k,i2wavefront->lo);
}
wavefront_t* const d2wavefront = wf_components->d2wavefronts[s];
if (d2wavefront != NULL) {
max_k = MAX(max_k,d2wavefront->hi);
min_k = MIN(min_k,d2wavefront->lo);
}
}
// Return
*out_max_k = max_k;
*out_min_k = min_k;
}
/*
* Display components
*/
void wavefront_display_print_element(
FILE* const stream,
wavefront_aligner_t* const wf_aligner,
wavefront_t* const wavefront,
const int k,
const int bt_length) {
// Check limits
if (wavefront!=NULL && wavefront->lo <= k && k <= wavefront->hi) {
const wf_offset_t offset = wavefront->offsets[k];
if (offset >= 0) {
fprintf(stream,"[%2d]",(int)offset);
// Print pcigar
if (bt_length > 0) {
char cigar_buffer[32];
const int pcigar_length = pcigar_unpack(wavefront->bt_pcigar[k],cigar_buffer);
const int effective_pcigar_length = MIN(bt_length,pcigar_length);
fprintf(stream,"%.*s",effective_pcigar_length,cigar_buffer);
PRINT_CHAR_REP(stream,' ',bt_length-effective_pcigar_length);
}
} else {
fprintf(stream,"[ ]");
PRINT_CHAR_REP(stream,' ',bt_length);
}
} else {
PRINT_CHAR_REP(stream,' ',bt_length+4);
}
}
void wavefront_display_print_frame(
FILE* const stream,
const int score_begin,
const int score_end,
const int row_width,
const int bt_length) {
// Align Y-label [k=000]
PRINT_CHAR_REP(stream,' ',WF_DISPLAY_YLABEL_LENGTH);
// Frame
fprintf(stream,"+");
const int num_blocks = score_end-score_begin+1;
const int frame_length = (num_blocks*row_width) + (num_blocks-1);
PRINT_CHAR_REP(stream,'-',frame_length);
fprintf(stream,"+\n");
}
void wavefront_display_print_score(
FILE* const stream,
const int score_begin,
const int score_end,
const int row_width,
const int bt_length) {
// Score label
PRINT_CHAR_REP(stream,' ',WF_DISPLAY_YLABEL_LENGTH);
int s;
for (s=score_begin;s<=score_end;++s) {
fprintf(stream,"|");
if (row_width >= 10) {
PRINT_CHAR_REP(stream,' ',row_width-10);
fprintf(stream,"%4d-score",s);
} else {
fprintf(stream,"s=%2d",s);
}
}
fprintf(stream,"|\n");
}
void wavefront_display_print_header_component(
FILE* const stream,
wavefront_t* const wavefront,
char* const wavefront_id,
const int bt_length) {
fprintf(stream,"[%s]",wavefront_id);
if (bt_length > 0) {
if (wavefront!=NULL && bt_length >= 10) {
PRINT_CHAR_REP(stream,' ',bt_length-10);
fprintf(stream,"[|BT|=%2d]",wavefront->bt_occupancy_max);
} else {
PRINT_CHAR_REP(stream,' ',bt_length-1);
}
}
}
void wavefront_display_print_header(
FILE* const stream,
wavefront_aligner_t* const wf_aligner,
const int score_begin,
const int score_end,
const int bt_length) {
// Parameters
wavefront_components_t* const wf_components = &wf_aligner->wf_components;
const distance_metric_t distance_metric = wf_aligner->penalties.distance_metric;
const int row_width = wavefront_display_compute_row_width(distance_metric,bt_length);
// Score header
fprintf(stream,"\n>[SCORE %d-%d]\n",score_begin,score_end);
// Frame
wavefront_display_print_frame(stream,score_begin,score_end,row_width,bt_length);
// Score header
wavefront_display_print_score(stream,score_begin,score_end,row_width,bt_length);
// Frame
wavefront_display_print_frame(stream,score_begin,score_end,row_width,bt_length);
// Wavefront labels
PRINT_CHAR_REP(stream,' ',WF_DISPLAY_YLABEL_LENGTH); // Align [k= ]
int score;
for (score=score_begin;score<=score_end;++score) {
const int s = (wf_components->memory_modular) ? score%wf_components->max_score_scope : score;
fprintf(stream,"|");
wavefront_display_print_header_component(stream,wf_components->mwavefronts[s]," M",bt_length);
if (distance_metric <= gap_linear) continue;
wavefront_display_print_header_component(stream,wf_components->i1wavefronts[s],"I1",bt_length);
wavefront_display_print_header_component(stream,wf_components->d1wavefronts[s],"D1",bt_length);
if (distance_metric == gap_affine) continue;
wavefront_display_print_header_component(stream,wf_components->i2wavefronts[s],"I2",bt_length);
wavefront_display_print_header_component(stream,wf_components->d2wavefronts[s],"D2",bt_length);
}
fprintf(stream,"|\n");
// Frame
wavefront_display_print_frame(stream,score_begin,score_end,row_width,bt_length);
}
/*
* Display
*/
void wavefront_aligner_print_block(
FILE* const stream,
wavefront_aligner_t* const wf_aligner,
const int score_begin,
const int score_end,
int bt_length) {
// Parameters
wavefront_components_t* const wf_components = &wf_aligner->wf_components;
const distance_metric_t distance_metric = wf_aligner->penalties.distance_metric;
if (!wf_components->bt_piggyback) bt_length = 0; // Check BT
// Compute dinmensions
int max_k, min_k;
wavefront_display_compute_limits(wf_aligner,score_begin,score_end,&max_k,&min_k);
// Header
wavefront_display_print_header(stream,wf_aligner,score_begin,score_end,bt_length);
// Traverse all diagonals
int k;
for (k=max_k;k>=min_k;k--) {
fprintf(stream,"[k=%3d] ",k);
// Traverse all scores
int i;
for (i=score_begin;i<=score_end;++i) {
const int s = (wf_components->memory_modular) ? i%wf_components->max_score_scope : i;
fprintf(stream,"|");
// Fetch wavefront
wavefront_t* const mwavefront = wf_components->mwavefronts[s];
wavefront_display_print_element(stream,wf_aligner,mwavefront,k,bt_length);
if (distance_metric <= gap_linear) continue;
wavefront_t* const i1wavefront = wf_components->i1wavefronts[s];
wavefront_t* const d1wavefront = wf_components->d1wavefronts[s];
wavefront_display_print_element(stream,wf_aligner,i1wavefront,k,bt_length);
wavefront_display_print_element(stream,wf_aligner,d1wavefront,k,bt_length);
if (distance_metric == gap_affine) continue;
wavefront_t* const i2wavefront = wf_components->i2wavefronts[s];
wavefront_t* const d2wavefront = wf_components->d2wavefronts[s];
wavefront_display_print_element(stream,wf_aligner,i2wavefront,k,bt_length);
wavefront_display_print_element(stream,wf_aligner,d2wavefront,k,bt_length);
}
fprintf(stream,"|\n");
}
// Footer
const int row_width = wavefront_display_compute_row_width(distance_metric,bt_length);
wavefront_display_print_frame(stream,score_begin,score_end,row_width,bt_length);
}
void wavefront_aligner_print(
FILE* const stream,
wavefront_aligner_t* const wf_aligner,
const int score_begin,
const int score_end,
const int num_wfs_per_row,
const int backtrace_length) {
// Print wavefronts by chunks
int s;
for (s=MAX(score_begin,0);s<=score_end;s+=num_wfs_per_row-1) {
const int block_score_end = MIN(s+num_wfs_per_row-1,score_end);
wavefront_aligner_print_block(stream,wf_aligner,s,block_score_end,backtrace_length);
if (block_score_end == score_end) break;
}
}
|