https://github.com/brentp/falas
Fragment-Aware Local Assembly for Short-reads
Science Score: 13.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
○.zenodo.json file
-
○DOI references
-
○Academic publication links
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (8.9%) to scientific vocabulary
Keywords
Repository
Fragment-Aware Local Assembly for Short-reads
Basic Info
- Host: GitHub
- Owner: brentp
- License: mit
- Language: Nim
- Default Branch: master
- Size: 20.5 KB
Statistics
- Stars: 7
- Watchers: 2
- Forks: 0
- Open Issues: 0
- Releases: 0
Topics
Metadata Files
README.md
FALAS: Fragment-Aware Local Assembly for Short-reads
This is a very simple local (re)assembler. It uses a simple algorithm that ends up being
very flexible and fast. The underlying datastructure is a sequence (list) of Contig structs.
When a new read is inserted into the seq of contigs, it is checked against each contig,
sliding the read sequence along the contig looking for a match. The read is then inserted into the best
matching contig, possibly extending it. Contigs are merged in an identical manner and the number of reads
supporting each base in the contig is tracked. It has several additional bells and whistles that make it
more useful:
It has a concept of "resolvable mismatches", these are cases when a read matches a contig very well at many sites, but at a few sites it has mismatches. These might be resolvable between reads/contigs if one contig has many pieces of evidence and the other has a single piece (could be due to a miscall). This allows optionally recovering reads with rare base-calling errors.
It is fragment-aware. Generally, when merging contigs, we'll want a pretty high number of bases of overlap. However, if we know that two contigs each contain a read from the same fragment, we can be confident they are on the same haplotype so we can merge the contigs even if their overlap is quite minimal.
It is not an assembler in the traditional sense. For germ-line data from a single sample, this software should only ever be responsible for "assembling" 2 haplotypes; there will not be any mismatches,insertions, or deletions, just haplotypes. This simplifies the datastructure so we can do things that are magnificently inefficient but still quite fast.
This is a nim library and will be used in other projects like indelope and other forthcoming projects. However, the concepts here-in might be useful independent of the software.
TODO
- [ ] for unmapped/mismapped reads, try both orientations.
Acknowledgements
the simplified assembly approach comes from Andrew Farrell. He uses this in rufus, his reference-free de novo variant caller.
As far as I know, the fragment-aware addition is unique to falas.
Owner
- Name: Brent Pedersen
- Login: brentp
- Kind: user
- Location: Oregon, USA
- Twitter: brent_p
- Repositories: 220
- Profile: https://github.com/brentp
Doing genomics
GitHub Events
Total
Last Year
Issues and Pull Requests
Last synced: over 1 year ago
All Time
- Total issues: 0
- Total pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Total issue authors: 0
- Total pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0