You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
<li><strong>We added the support of suffix matching of seeds, making seeds much more tolerant to mutations</strong>. Any 31-bp seed with a common ≥15 bp prefix or suffix can be matched, which means <strong>seeds are immune to any single SNP</strong>.</li>
1543
1543
</ol>
1544
1544
</li>
1545
-
<li>A multi-level index enables fast and low-memory variable-length seed matching and chaining.</li>
1545
+
<li>A hierarchical index enables fast and low-memory variable-length seed matching and chaining.</li>
1546
1546
<li>A pseudo alignment algorithm is used to find similar sequence regions from chaining results for alignment.</li>
"description": "Table of contents Table of contents TL;DR Input Hardware requirements Algorithm Parameters Steps Output File structure Index size Explore the index TL;DR Prepare input files: Sequences of each reference genome should be saved in separate FASTA\/Q files, with identifiers in the file names. E.g., GCF_000006945.2.fna.gz While if you save a few small (viral) complete genomes (one sequence per genome) in each file, it’s feasible as sequence IDs in search result can help to distinguish targe genomes.",
62
-
"wordCount" : "2840",
62
+
"wordCount" : "2851",
63
63
"inLanguage": "en",
64
64
"isFamilyFriendly": "true",
65
65
"mainEntityOfPage": {
@@ -2045,12 +2045,12 @@ <h1>Step 1. Building a database</h1>
0 commit comments