Home
last modified time | relevance | path

Searched refs:compareKmers (Results 1 – 17 of 17) sorted by relevance

/dports/biology/velvet/velvet_1.2.10/src/
H A Dsplay.c136 while (compareKmers(kmer, &(T->kmer))) { in Splay()
137 if (compareKmers(kmer, &(T->kmer)) < 0) { in Splay()
140 if (compareKmers(kmer, &(T->left->kmer)) < 0) in Splay()
151 if (compareKmers(kmer, &(T->right->kmer)) > 0) in Splay()
190 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in insertIntoTree()
197 } else if (compareKmers(&((*T)->kmer), kmer) < 0) { in insertIntoTree()
227 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in findOrInsertOccurenceInSplayTree()
240 } else if (compareKmers(kmer, &((*T)->kmer)) > 0) { in findOrInsertOccurenceInSplayTree()
H A DkmerOccurenceTable.c57 return compareKmers(&(a->kmer), &(b->kmer)); in compareKmerOccurences()
89 diff = compareKmers(&(array[middleIndex].kmer), kmer); in findKmerInKmerOccurenceTable()
H A Dkmer.h33 int compareKmers(Kmer* k1, Kmer* k2);
H A DsplayTable.c484 if (compareKmers(&word, &antiWord) <= 0) { in printAnnotations()
646 …ile (readNucleotideIndex < getLength(tString) && (compareKmers(&antiWord, &polyA) == 0 || compareK… in computeClearHSPs()
668 if (compareKmers(&word, &antiWord) <= 0) { in computeClearHSPs()
829 if (compareKmers(&word, &antiWord) <= 0) in inputReferenceIntoSplayTable()
H A DgraphReConstruction.c610 if (!double_strand || compareKmers(&word, &antiWord) <= 0) in referenceGraphKmers()
741 if (compareKmers(&word, &antiWord) <= 0) { in ghostThreadSequenceThroughGraph()
935 if (compareKmers(&word, &antiWord) <= 0) { in threadSequenceThroughGraph()
1288 if (compareKmers(&word, &antiWord) <= 0) { in addReadsToGraph()
H A Dkmer.c328 int compareKmers(Kmer* k1, Kmer* k2) { in compareKmers() function
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-v0.3.1/src/
H A Dsplay.c121 while (compareKmers(kmer, &(T->kmer))) { in Splay()
122 if (compareKmers(kmer, &(T->kmer)) < 0) { in Splay()
125 if (compareKmers(kmer, &(T->left->kmer)) < 0) in Splay()
136 if (compareKmers(kmer, &(T->right->kmer)) > 0) in Splay()
175 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in insertIntoTree()
182 } else if (compareKmers(&((*T)->kmer), kmer) < 0) { in insertIntoTree()
212 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in findOrInsertOccurenceInSplayTree()
225 } else if (compareKmers(kmer, &((*T)->kmer)) > 0) { in findOrInsertOccurenceInSplayTree()
268 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in placeOccurenceInSplayTree()
281 } else if (compareKmers(&((*T)->kmer), kmer) < 0) { in placeOccurenceInSplayTree()
[all …]
H A DgraphReConstruction.c108 if (compareKmers(&(a->kmer), &(b->kmer)) < 0) in compareKmerOccurences()
110 else if (compareKmers(&(a->kmer), &(b->kmer)) > 0) in compareKmerOccurences()
279 if (!double_strand || compareKmers(&word, &antiWord) <= 0) { in referenceGraphKmers()
354 else if (compareKmers(&(array[middleIndex]).kmer, kmer) == 0) in findKmerOccurenceInSortedTable()
358 else if (compareKmers(&(array[middleIndex]).kmer, kmer) > 0) in findKmerOccurenceInSortedTable()
437 if (compareKmers(&word, &antiWord) <= 0) { in ghostThreadSequenceThroughGraph()
544 if (compareKmers(&word, &antiWord) <= 0) { in threadSequenceThroughGraph()
H A Dkmer.h31 int compareKmers(Kmer* k1, Kmer* k2);
H A DsplayTable.c140 if (compareKmers(&word, &antiWord) <= 0) { in inputSequenceIntoSplayTable()
321 if (compareKmers(&word, &antiWord) <= 0) in inputMaskIntoSplayTable()
H A Dkmer.c204 int compareKmers(Kmer* k1, Kmer* k2) { in compareKmers() function
323 printf("%i\n", compareKmers(k2, &kmer)); in testKmers()
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-1.2.01/Velvet-1.1.06/
H A Dsplay.c136 while (compareKmers(kmer, &(T->kmer))) { in Splay()
137 if (compareKmers(kmer, &(T->kmer)) < 0) { in Splay()
140 if (compareKmers(kmer, &(T->left->kmer)) < 0) in Splay()
151 if (compareKmers(kmer, &(T->right->kmer)) > 0) in Splay()
190 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in insertIntoTree()
197 } else if (compareKmers(&((*T)->kmer), kmer) < 0) { in insertIntoTree()
227 if (compareKmers(kmer, &((*T)->kmer)) < 0) { in findOrInsertOccurenceInSplayTree()
242 } else if (compareKmers(kmer, &((*T)->kmer)) > 0) { in findOrInsertOccurenceInSplayTree()
H A DkmerOccurenceTable.c57 return compareKmers(&(a->kmer), &(b->kmer)); in compareKmerOccurences()
89 diff = compareKmers(&(array[middleIndex].kmer), kmer); in findKmerInKmerOccurenceTable()
H A Dkmer.h33 int compareKmers(Kmer* k1, Kmer* k2);
H A DsplayTable.c482 if (compareKmers(&word, &antiWord) <= 0) { in printAnnotations()
693 …ile (readNucleotideIndex < getLength(tString) && (compareKmers(&antiWord, &polyA) == 0 || compareK… in computeClearHSPs()
715 if (compareKmers(&word, &antiWord) <= 0) { in computeClearHSPs()
873 if (compareKmers(&word, &antiWord) <= 0) in inputReferenceIntoSplayTable()
H A DgraphReConstruction.c610 if (!double_strand || compareKmers(&word, &antiWord) <= 0) in referenceGraphKmers()
741 if (compareKmers(&word, &antiWord) <= 0) { in ghostThreadSequenceThroughGraph()
936 if (compareKmers(&word, &antiWord) <= 0) { in threadSequenceThroughGraph()
H A Dkmer.c328 int compareKmers(Kmer* k1, Kmer* k2) { in compareKmers() function