Comments (4)
Hi Lan,
You could try to hack the edge coverage at the moment by specifying them all to be zero. This would be done by adding:
ec:i:0
To each link in the GFA (with a tab to separate from previous tags/link data on the line).
I can see if I can add this in as an option by default though. Out of interest, which software generated your GFA?
Best,
M
from gfatk.
Hi,
Thanks for your suggestion!
I added the ec:i:0 to the GFA file, finally I could get results.
But [-] The input GFA has multiple subgraphs (2). [-] Detected 16051 nodes in a subgraph. Skipping.
, and the result only return the longest path with CCTGAA.
This GFA file was a pangenome of mitochondrion, and generated by seqwish.
It's graph looks like a circle.
Could you give me some advices to handle it to find the longest path in this GFA?
Best wishes,
Lan
from gfatk.
Hi Lan,
This is probably because it would be impossible to calculate the longest path through that graph with 16,000 + nodes using the algorithm currently implemented unfortunately. This is because the underlying algorithm is doing an all-vs-all node path calculation. You would need far fewer nodes for the calculation to work ( < 100). If you could somehow reduce the node number, you may be able to calculate a longest path.
The software is mainly intended to work for smallish plant mitochondrial GFA's generated from MBG, but I'm glad you tried it out and I hope some of the other subcommands were useful :)
Sorry to be the bearer of bad news!
M
from gfatk.
Thanks for your user-friendly software.
Although, I cannot use it this time, I will try gfatk in my other project.
Again, many thanks for your kindness suggestions and help!
from gfatk.
Related Issues (15)
- `gfatk linear` should linearise within subgraphs
- Remove redundancy from end of last joined contig HOT 1
- Allow user supplied path in `gfatk linear`
- Add `gfatk extract-chloro` command
- Make `gfatk extract` be able to take more than one seg ID
- Extract multiple mito contigs HOT 1
- Restrict linear based on node number
- Extract a BED file of the joined coordinates in `gfatk linear`
- `gfatk linear -ei` bug HOT 1
- Add upper node number limit to `gfatk linear`
- Format GFA to be compatible with gfatk
- Obtain path sequences as specified in P-lines HOT 11
- Allow any name for GFA segments, lines, paths etc.
- Hashmap for NodeIndex <-> segment ID 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 gfatk.