Search Results for "algorithm" - Page 2
Sort By:
Showing 144 open source projects for "algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
INTEGRATE: Calling gene fusions with exact fusion junctions and genomic breakpoints by combining RNA-Seq and WGS data. To download source code, reference manual and test case, please go to 'Files'. Also refer to 'Wiki' for details.
-
2
MUMAL2
Multivariate analysis of MS/MS data using ML techniques
Program described in the paper: MUMAL2: Improving sensitivity in shotgun proteomics using cost sensitive artificial neural networks and a threshold selector algorithm, 2016. By Fabio R. Cerqueira; Adilson M. Ricardo; Alcione P. Oliveira; Armin Graber; Christian Baumgartner. -
3
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
- MixtureModel_v1r1: overlapping community algorithm [3], which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman... -
4
Visualization of Protein-Ligand Graphs
Compute protein graphs. Moved to https://github.com/MolBIFFM/PTGLtools
NOTE: Project moved to https://github.com/MolBIFFM/PTGLtools. The Visualization of Protein-Ligand Graphs (VPLG) software package computes and visualizes protein graphs. It works on the super-secondary structure level and uses the atom coordinates from PDB files and the SSE assignments of the DSSP algorithm. VPLG is command line software. If you do not like typing commands, try our PTGL web server: http://ptgl.uni-frankfurt.de/ -
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
5
Morpheus search algorithm
a mass spectrometry–based proteomics database search algorithm
Morpheus is a mass spectrometry–based proteomics database search algorithm designed from the ground up for high-resolution tandem mass spectra. We have discovered that for high-resolution MS/MS, simple spectrum preprocessing and scoring performs superior to more complex algorithms originally developed for low-resolution MS/MS, such as Sequest, Mascot, and OMSSA. Morpheus is also very fast—up to nearly 5 times faster than OMSSA for large human datasets. It is written in C# and is available open... -
6
MULTOVL
Multiple overlaps of genomic regions
The MULTOVL suite of programs finds multiple overlaps among genomic regions. The MULTOVL algorithm can detect several kinds of region overlaps. In addition to the N-fold overlaps you can detect solitary regions which are the input regions that do not overlap with any other region in the input data set, and union overlaps that is the union of the input regions that overlap at least once somewhere. IMPORTANT NOTICE: MULTOVL has been migrated to BitBucket. Please refer to the MULTOVL website... -
7
erne
ERNE - Extended Randomized Numerical alignEr
We present ERNE (Extended Randomized Numerical alignEr), a short string alignment package whose goal is to provide an all-inclusive set of tools to handle short (NGS-like) reads. ERNE comprises ERNE-FILTER (read trimming and continamination filtering), ERNE-MAP (core alignment tool/algorithm), ERNE-BS5 (bisulfite treated reads aligner), and ERNE-PMAP/ERNE-PBS5 (distributed versions of the aligners), -
8
MSAProbs: Multiple Sequence Alignment
One of the most accurate multiple protein sequence aligners
MSAProbs is an open-source protein multiple sequence ailgnment algorithm, achieving the stastistically highest alignment accuracy on popular benchmarks: BALIBASE, PREFAB, SABMARK, OXBENCH, compared to ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. -
9
skewer
A fast and sensitive adapter trimmer for illumina paired-end sequences
This program implements a novel dynamic programming algorithm dedicated to the task of adapter trimming and it is specially designed for processing illumina paired-end sequences. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
10
iCAS - An Illumina Clone Assembly System
An Illumina clone assembly system using SOAPdenovo and ABySS
Clone-by-clone sequencing, as a means of achieving high quality assemblies for large and complex genomes, continues to be of great relevance in the era of high throughput sequencing. However, assemblies obtained using current whole genome assemblers are often fragmented and sometimes have issues of genome completeness owing to different data characteristics introduced by multiplexed sequencing. With iCAS the data filtering process is based on a novel kmer frequency algorithm, resulting... -
11
TAG
A tool for metatranscriptome assembly using metagenome graph
TAG is a tool for metatranscriptome assembly using de Bruijn graph of matched metagenome as the reference. TAG is an application of a reads mapping algorithm that we developed for mapping of short reads onto a de Bruijn graph of assemblies. A hash table of junction k-mers (k-mers spanning branching structures in the de Bruijn graph) is used to facilitate fast mapping of reads to the graph. We have shown that TAG helps to assemble substantially more transcripts from metatranscriptomic... -
12
LaNet-vi provides images of large scale networks on a two-dimensional layout. The algorithm is based on the k-core and k-dense (m-core) decomposition. For more details see http://lanet-vi.fi.uba.ar.
-
13
ExSTraCS
Extended Supervised Tracking and Classifying System
This advanced machine learning algorithm is a Michigan-style learning classifier system (LCS) developed to specialize in classification, prediction, data mining, and knowledge discovery tasks. Michigan-style LCS algorithms constitute a unique class of algorithms that distribute learned patterns over a collaborative population of of individually interpretable IF:THEN rules, allowing them to flexibly and effectively describe complex and diverse problem spaces. ExSTraCS was primarily developed... -
14
CNVision
CNV prediction from Illumina genotyping data
CNVision is a Perl script that runs Illumina genotyping data (all chips from 300k to latest Omni) through PennCNV, QuantiSNPv2.3 and GNOSIS (an in-built algorithm). It merges the results and assesses the quality of the raw data. CNVision can also identify de novo CNVs in family-based data using a highly accurate algorithm that considers the possibility of CNVs in either parent based on the raw genotyping data. The script is optimized to work in a UNIX-based environment; it should work... -
15
mCarts
A hidden Markov model to predict clustered RNA motif sites
Many RBPs recognize very short and degenerate sequences, with targeting specificity achieved by mechanisms such as synergistic binding to multiple clustered sites and modulation of site accessibility through different RNA-secondary structures. mCarts integrates the number and spacing of individual motif sites, their accessibility and conservation, which substantially improves signal to noise ratio. This algorithm learns and quantifies rules of these features, taking advantage of a large number... -
16
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79... -
17
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
18
NOFI ranking
The Non-Outlier Fragment Ion ranking for enhaced DIA quantification
The NOFI ranking algorithm has been developed to assign low priority to fragment ions affected by interference. The implementation is an R script that can be customized. A future version will contain a modular version. The outline is as follows: 1) The input contains the list of SWATH fragment ion XICs from the identified and quantified peptides by software tools such as Skyline and OpenSWATH. 2) The first step in NOFI is the computation of the 4 attributes (RTd, FWHMd, IRd and IRrep) used... -
19
MassWiz
Proteomics MS/MS database search engine
Open Source MS/MS algorithm with integrated target-decoy based FDR. Reference- http://pubs.acs.org/doi/abs/10.1021/pr200031z , Check out the wiki site for help and support - https://sourceforge.net/apps/mediawiki/masswiz/index.php?title=Main_Page -
20
SoftSV
Calling structural variations. The soft way.
SoftSV is a tool for the detection of small and large deletions, inversions, tandem duplications and translocations from paired-end sequencing data. It uses aberrant paired-end mappings to determine approximative breakpoint regions and refines the breakpoints by analysing soft-clipped sequences for potential split-reads. For more information about the algorithm and an evaluation, have a look at this publication: "Robust and exact structural variation detection with paired-end and soft... -
21
... are.... (1) Configured for 4 open source algorithms to perform database searching for peptide identification. Any combination of the 4 algorithm can be chosen. (2) Lists out the genome search specific peptides(Novel peptides). (3) Spectral matches can be visualized for the quality assessment. (4) Lists out the novel proteins and changes in the existing protein annotations. (5) A Visual genomic context of the novel peptides can also be generated.
-
22
mAPV
modified Asymmetric Pseudo-Voigt Model
A new peak detection algorithm for MALDI mass spectrometry data based on a modified Asymmetric Pseudo-Voigt model -
23
SWAPHI-LS: Alignment on Xeon Phi Cluster
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host. -
24
cusAPV
customized Asymmetric Pseudo-Voigt Model
A new peak detection algorithm for MALDI mass spectrometry data based on a customized Asymmetric Pseudo-Voigt model -
25
RT-alignment
Graph-based time alignment algorithms for multiple LC-MS datasets
... changes under different conditions. The main challenge in this task lies in correcting retention time shifts, which are inevitable even on the same instrument and under the same elution conditions. For large-scale studies, multiple instruments or multi-week experiments are often required, which exacerbates the problem. We present a new graph-based time alignment algorithm that can align these less similar LC-MS maps, which cannot be effectively handled by existing methods.
