text
stringlengths 0
14.1k
|
---|
gt_array_get(sacluster->members, i)); |
} |
ags->numofstoredsaclusters++; |
while (currentexon < numofexons) { |
node = getcoreExonnodefromSA(sacluster->representative, currentexon); |
if (currentnode < gt_array_size(nodes)) { |
/* compare current node with current exon */ |
if (!gt_range_overlap(&node.range, |
&((Exonnode*) gt_array_get(nodes, currentnode)) |
->range)) { |
/* the current exon does not overlap with the current node, |
visit next node */ |
currentnode++; |
} |
else { |
/* left borders are equal, merge exon and node */ |
mergenodes(gt_array_get(nodes, currentnode), &node); |
currentnode++; |
currentexon++; |
} |
freecoreExonnode(&node); |
} |
else { |
/* save this node */ |
gt_array_add(nodes, node); |
currentnode++; |
currentexon++; |
} |
} |
} |
void gth_build_AGS_from_assembly(GthAGS *ags, GtBittab *assembly, |
GtArray *saclusters) |
{ |
unsigned long i; |
GtArray *nodes; |
GthExonAGS exonAGS; |
GthSpliceSiteProb splicesiteprob; |
Exonnode *exonnode; |
nodes = gt_array_new(sizeof (Exonnode)); |
/* compute AGS, the exons are stored es Exonnodes, which are saved later |
(see below) */ |
for (i = 0; i < gt_array_size(saclusters); i++) { |
if (gt_bittab_bit_is_set(assembly, i)) |
addSAtoAGS(ags, *(GthSACluster**) gt_array_get(saclusters, i), nodes); |
} |
/* save exons */ |
for (i = 0; i < gt_array_size(nodes); i++) { |
exonnode = gt_array_get(nodes, i); |
exonAGS.range = exonnode->range; |
exonAGS.score = computeexonscore(exonnode); |
gt_array_add(ags->exons, exonAGS); |
} |
/* at least one exon node exists */ |
gt_assert(gt_array_size(nodes)); |
/* save the splice site probabilites (stored in the intron infos) */ |
for (i = 0; i < gt_array_size(nodes) - 1; i++) { |
exonnode = gt_array_get(nodes, i); |
splicesiteprob.donorsiteprob = exonnode->successorintron |
->donorsiteprobability; |
splicesiteprob.acceptorsiteprob = exonnode->successorintron |
->acceptorsiteprobability; |
gt_array_add(ags->splicesiteprobs, splicesiteprob); |
} |
/* last successor intron info points to null */ |
gt_assert(((Exonnode*) gt_array_get_last(nodes))->successorintron == NULL); |
/* free space for nodes */ |
for (i = 0; i < gt_array_size(nodes); i++) { |
exonnode = gt_array_get(nodes, i); |
freecoreExonnode(exonnode); |
} |
gt_array_delete(nodes); |
} |
" gpl-2.0 |
mikeusry/Townsend-Security login_frame.php 121 "<?php |
header('HTTP/1.1 301 Moved Permanently'); |
header('Location: http://www.townsendsecurity.com/support/ticket'); |
?> |
" gpl-2.0 |
smartYi/Speech-recognition README.md 112 "# Speech-recognition |
This is the source code for the project speech recognition system for course 188779 in CMU |
" gpl-2.0 |
robinfoe/blmk public/scripts/froogaloop/script.js 11895 "// Scroll to the very bottom to see the stuff we wrote, the big giant blocks are: |
// froogaloop |
// and |
// fitvid.js |
;(function( $ ){ |
'use strict'; |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.