Results for "handling"
Bookmarks
MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping
...short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobi...2904 days ago
OPERA : Optimal Paired-End Read Assembler
...errors, improve efficiency etc.) and incorporated features that are important for scaffolding large genomes (multi-library support, better repeat-handling etc.), in addition to other s...2793 days ago
BLAST Ring Image Generator (BRIG)
...is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The app...2772 days ago
Many-Core Engine (MCE) for Perl example
...es the Core API for Many-Core Engine. The various MCE options are described here. MCE::Signal Temporary directory creation, cleanup, and signal handling. MCE::Util Utility function...2649 days ago
- ...is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The app...
2632 days ago
GraphMap - A highly sensitive and accurate mapper for long, error-prone reads
...and precision across different error profiles, rates and sequencing technologies even with default parameters. Circular genome handling to resolve coverage drops nea...2522 days ago
QuorUM: An Error Corrector for Illumina Reads
...advertised 1%) error rate, 100 × coverage Illumina data on average has an error in some read at every base in the genome. These errors make handling the data more complicated bec...2367 days ago
RGFA: powerful and convenient handling of assembly graphs
RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the sep...1565 days ago
LAMSA: fast split read alignment with long approximate matches
LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads...2180 days ago
GRAbB: Selective Assembly of Genomic Regions, a New Niche for Genomic Research
GRAbB is shown to be more efficient than MITObim in terms of speed, memory and disk usage. The other functionalities (handling multiple targets simultaneously and extracting homologous...1923 days ago
