Search Results for "algorithm"
Sort By:
63 programs for "algorithm" with 2 filters applied:
-
Simplify IT and security with a single endpoint management platformNinjaOne automates the hardest parts of IT, delivering visibility, security, and control over all endpoints for more than 20,000 customers. The NinjaOne automated endpoint management platform is proven to increase productivity, reduce security risk, and lower costs for IT teams and managed service providers. The company seamlessly integrates with a wide range of IT and security technologies. NinjaOne is obsessed with customer success and provides free and unlimited onboarding, training, and support.
-
Your top-rated shield against malware and online scams | Avast Free AntivirusOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
1
BD-Func
Bidirectional Functional Enrichment of Gene Expression Data
BD-Func is an algorithm to predict activation or inhibition of pathways based upon gene expression patterns. If you use BD-Func, please cite: Warden C, Kanaya N, Chen S, and Yuan Y-C. (2013) BD-Func: A Streamlined Algorithm for Predicting Activation and Inhibition of Pathways. peerJ, 1:e159 -
2
The Interactome-Transcriptome Integration (ITI) algorithm allows the analysis of gene expression data by superimposition of a large scale protein-protein interaction data (human interactome) over several gene expression datasets. ITI extracts regions in the interactome with differentiating expression over two conditions. These subnetworks can that be used to build a generalizable and stable genomic signature for genomic/cancer classification.
-
3
ModST
A tool to search post-translational modifications in a blind mode
ModST (pronounced as modest) is a tool to search post-translational modifications (PTMs) in mass spectrometry data in an unrestrictive manner. It can search for hundreds of modification without any user provided information for variable modifications. Due to data level parallelization implemented through perl it is fast, portable and easy to use to identify and analyse PTMs in MS/MS data. -
4
COHCAP
City of Hope CpG Island Analysis Pipeline
COHCAP (City of Hope CpG Island Analysis Pipeline, pronounced "co-cap") is an algorithm to analyze single-nucleotide resolution methylation data (Illumina 450k methylation array, targeted BS-Seq, etc.). Please note: 1) The SourceForge version of COHCAP is no longer being updated. Please see the GitHub version: https://github.com/cwarden45/COHCAP This was the source repository for the Bioconductor version, with some changes after the decision to only provide the code through GitHub... -
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.
-
5
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In contrast...
-
6
PF_HP
Prediction of proteinfolding in 2D HP model
Even in the simplified two dimensional HP-model (hydrophob/polar) the prediction of proteinfolding is NP complete. We implement a brute force algorithm with serial and parallel execution to solve short inputs of HP sequences (0-1 bitstrings). Selbst im vereinfachten zweidimensionalen HP-Modell (hydrophob/polar) ist die Proteinfaltung bereits NP-vollständig. Hier implementieren wir einen brute-force Algorithmus zur Lösung kurzer Eingabesequenzen (0-1-Bitstrings) für die Proteinfaltung... -
7
JSiteDescriptor
Binding site descriptor generation for SVM based classification.
A set of java programs that extract coordinate and chemical information from PDB files. The binding site regions are extracted using grid based scheme. For binding site, spatio-chemical descriptor is generated based on PocketMatch algorithm of Dr. Kalidas (author of this project too). -
8
faif
C++ header only library with AI and bioinformatics algorithms
C++ header only library, small and fast; Naive Bayesian Classifier, Decision Tree Classifier (ID3), DNA/RNA nucleotide second structure predictor, timeseries management, timeseries prediction, generic Evolutionary Algorithm, generic Hill Climbing algorithm and others. -
9
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/ -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
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... -
11
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.
-
12
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... -
13
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. -
14
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... -
15
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. -
16
SWAPHI: Smith-Waterman on Intel Xeon Phi
The first protein sequence database search on shared-host Xeon Phis
The first parallel algorithm to accelerate the Smith-Waterman protein database search on shared-host multiple Intel Xeon Phi coprocessors. By searching against the UniProtKB/TrEMBL database, SWAPHI achieves a performance of up to 58.8 billion cell updates per second (GCUPS) on a single Xeon Phi and up to 228.4 GCUPS on four Xeon Phis. -
17
fitGCP
Fitting genome coverage distributions with mixture models
... this information accessible can improve the quality of sequencing experiments and quantitative analyses. fitGCP is a framework for fitting mixtures of probability distributions to genome coverage profiles. Besides commonly used distributions, fitGCP uses distributions tailored to account for common artifacts. The mixture models are iteratively fitted based on the Expectation-Maximization algorithm. Please find the accompanying paper here: http://dx.doi.org/10.1093/bioinformatics/btt147 -
18
This space is not maintained anymore. If you want to get the latest updates on fpocket refer to https://github.com/Discngine/fpocket. Fpocket is a very fast open source protein pocket detection algorithm based on Voronoi tessellation. The platform is suited for the scientific community willing to develop new scoring functions and extract pocket descriptors on a large scale level.
-
19
FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences.
-
20
RaTrav
mean first passage times and node occupancies calculations
.... Torchala, P. Chelminiak, M. Kurzynski and P. A. Bates, 'RaTrav: a tool for calculating mean first-passage times on biochemical networks', BMC Syst. Biol. 7, 130 (2013). M. Torchala, P. Chelminiak and P. A. Bates, 'Mean first-passage time calculations: comparison of the deterministic Hill's algorithm with Monte Carlo simulations', Eur. Phys. J. B 85, 116 (2012). -
21
mrCaNaVaR is a more user friendly and faster re-implementation of our previously published algorithm together with the mrFAST/mrsFAST/drFAST read mapping programs to discover large segmental duplications and deletions and predicts absolute copy numbers.
-
22
hrefinder
Detection of homologous recombination events from SNP data
This software detects homologous recombination events (HREs) from SNP data. Based on SNP alleles calls and locations, it breaks the genomes into locally colinear blocks, and looks for cases where SNPs do not agree with the vertical pattern of inheritance in a phylogeny. It applies a dynamic programming algorithm to model whether changes within a block are likely a result of mutations, sequencing errors, or HRE. We use information from the nearby SNPs, so that if 1-2 alleles in a series of SNPs... -
23
GenNon-h
Simulating non-homogeneous multiple sequence alignments
... sequence alignments under the discrete-time Markov processes on phylogenetic trees, which samples directly from the transition matrices. Based on the input model and a phylogenetic tree in the Newick format (with branch lengths measured as the expected number of substitutions per site), the algorithm produces DNA alignments of desired length. GenNon-H is a collaborative project described at http://genome.crg.es/cgi-bin/phylo_mod_sel/AlgGenNonH.pl. -
24
NeedlemanWunsch
Fast global sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align Global optimal sequence alignment using the Needleman-Wunsch algorithm. Aligns DNA, RNA, protein sequence and more! See our sister project local alignment using Smith-Waterman: http://sourceforge.net/projects/smithwaterman/ -
25
Darwin 2: Java Framework for Evolutionary Computation (genetic algorithm, GA). A true framework with out-of-the-box functionality and extensibility of all classes. Interface-based pattern with dependency-injection to configure components.
