BioStar
Bioinformatician
Our Sponsors
Related items
FOGSAA: Fast Optimal Global Sequence Alignment Algorithm
By Jit 3010 days agowww.isical.ac.in - Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a...AlfaPang: alignment free algorithm for pangenome graph construction
By BioStar 191 days agogithub.com - AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input...AnchorWave
By Neel 1473 days agogithub.com - AnchorWave (Anchored Wavefront Alignment) identifies collinear regions via conserved anchors (full-length CDS and full-length exon have been implemented currently) and breaks collinear regions into shorter fragments, i.e., anchor and inter-anchor...RNA Bioinformatics and High Throughput Analysis Jena
Research Topics: High Throughput Sequencing Analysis Comparative Genomics Identification and Annotation of Non-coding RNAs Bioinformatic Analysis and System Biology of Viruses Coevolution of Proteins and RNAs Algorithmic...ReMILO: reference assisted misassembly detection algorithm using short and long reads.
By Jit 2801 days agogithub.com - ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called...FLAS: fast and high throughput algorithm for PacBio long read self-correction.
By Jit 2450 days agogithub.com - FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes...GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.
By Abhimanyu Singh 3210 days agogithub.com - GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which...AGORA: Algorithm for Gene Order Reconstruction in Ancestors
By Jit 1467 days agogithub.com - AGORA stands for “Algorithm for Gene Order Reconstruction in Ancestors” and was developed by Matthieu Muffato in the DYOGEN Laboratory at the École normale supérieure in Paris in 2008. // | | // ) ) // ) )...Smash: An alignment-free method to find and visualise rearrangements between pairs of DNA sequences
By Jit 3602 days agobioinformatics.ua.pt - Smash is a completely alignment-free method/tool to find and visualise genomic rearrangements. The detection is based on conditional exclusive compression, namely using a FCM (Markov model), of high context order (typically 20). For...Spines
By Jit 3386 days agowww.broadinstitute.org - Spines is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation...
