Comments (4)
Increasing k ≥ 15 solves the second case, but not the first.
from kevlar.
I wonder if this is caused by false positives? You might try calculating cg.kmer_degree
and then taking a look at @camillescott's JunctionCountAssembler code in dib-lab/khmer#1502
from kevlar.
If it's a CountMinSketch FP, this should be handled by loading reads with interesting k-mers into a separate node graph.
from kevlar.
Reviving this dormant thread.
As far as I've been able to tell this issue has been caused primarily by sequencing errors. khmer has plenty of scripts and functions to deal with this, but we for a while we couldn't come up with the secret QC sauce. Trimming or error correction was never feasible for the raw data. Variable-coverage trimming had weird and unintended results on the boring-reads-dumped data. Digital normalization would provide at best a marginal improvement with a risk of loss of sensitivity (lower risk but also lower benefit by raising normalization threshold). So alas, the last few months I've devoted time to, among other things, implementing a greedy assembly algorithm from scratch.
In implementing the assembler, we came up with an approach for partitioning the reads based on shared interesting k-mers. This turned out to be much more useful than khmer's partitioning code, and led to a great discovery: running abundance trimming (not variable coverage trimming!) on each individual partition, followed by greedy assembly, produced reliable contigs!
This morning, I was curious and revisited kevlar collect
which I had all but deprecated (this uses khmer's linear path assembly). Turns out, running this on individual partitions that have been abundance trimmed also seems to produce reliable contigs. Sigh.
So it looks like the breakthrough, ridiculously simple in retrospect, is to partition interesting reads by shared interesting k-mers, and then do abundance trimming and assembly on individual partitions. Assembly details may or may not make much of a difference.
from kevlar.
Related Issues (20)
- Bug with log-space transformation
- Command or script for inspecting ambiguous calls
- MemoryError HOT 3
- Execution failed due to high FPR in case HOT 4
- Failed tests HOT 8
- Dead links to tutorial files HOT 3
- Empty files produced by kevlar split cause crash of kevlar assemble HOT 3
- python 3.6 install - pytest failures - 26 failed, 347 passed (pytest 5.3.5?) HOT 5
- Tutorial: Error on running kevlar filter HOT 9
- Clarification - how to avoid high FPR HOT 3
- kevlar memory error HOT 2
- partition, node error HOT 3
- Controls for simlike HOT 2
- VCF Parsing Issue HOT 1
- Where is kevlar? HOT 3
- How to just get the Kmer?
- Kevlar novel multithreading HOT 2
- count_control error: estimated false positive rate is 0.385 (FPR too high, bailing out!!! HOT 5
- > 30,000 variants reported from trio-analysis with FPR 0.001? HOT 6
- Is kevlar able to detect duplications/repeat expansions and in general CNV? HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from kevlar.