Search Results for "algorithm" - Page 22
Sort By:
Showing 1986 open source projects for "algorithm"
View related business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
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.
-
1
GenCodeGenerator
C++ class to generate biologically plausible genetic codes
... genetic codes, with the reqirement of block structure, and, optionally, with the assumption of stereochemical or biosynthetic models (to impose the assumption of the adaptive model, simply filter the codes using the error_cost() function). See Appendix in Makukov & shCherbak (2017) for the description of the algorithm. The code requires Qt 5. To compile the provided example, run 'qmake' to produce the Makefile, and then run 'make' to compile the executable file. License: Public Domain. -
2
A star
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm -
3
CUDA-MEME
Ultrafast scalable motif discovery algorithm using GPU computing
mCUDA-MEME is a well-established ultrafast scalable motif discovery algorithm based on MEME (version 4.4.0) algorithm for multiple GPUs using a hybrid combination of CUDA, MPI and OpenMP parallel programming models. This algorithm is a further extension of CUDA-MEME (based on MEME version 3.5.4) with respect to accuracy and speed and has been tested on a GPU cluster with eight compute nodes and two Fermi-based Tesla S2050 (and Tesla-based Tesla S1070) quad-GPU computing systems, running... -
4
DES-Rotem
DES attempt to crack code with 3 rounds
This Java project is an attempt to crack the key in a DES encryption algorithm. The plaintext and the cyphertext are known. The purpose is to crack the 64-bit key with 3 rounds instead of 16. This project checks all 2^64 possible keys. Therefore, it takes a long time to find the correct key. -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
5
This package includes a collection of MATLAB files which are designed to: 1. Given a calibration scan of the image of a point emitter with an engineered point spread function (PSF), 2. Perform a phase retrieval algorithm based on maximum likelihood estimation (MLE) of a phase aberration term which is added to the theoretical pupil function of the imaging system. 3. Use the phase-retrieved pupil function to perform single-emitter localization. Accompanying publication available here...
-
6
tracking.js
A modern approach for Computer Vision on the web
The tracking.js library brings different computer vision algorithms and techniques into the browser environment. By using modern HTML5 specifications, we enable you to do real-time color tracking, face detection and much more, all that with a lightweight core (~7 KB) and intuitive interface. To get started, download the project. This project includes all of the tracking.js examples, source code dependencies you'll need to get started. Unzip the project somewhere on your local drive. The... -
7
HapAltMin
Haplotype assembly software using Alternating Minimization Algorithm
HapAltMin is a Haplope assembly software based on the principles of Binary Matrix Completion using Alternating Minimization Iterative Procedure. This software takes as input the Haplotype-relevant Fragment files and phases haplotypes for diploid organisms. -
8
QSdpR
Viral Quasispecies Reconstruction software based on QSdpR algorithm
This is a viral quasispecies reconstruction software for quasispecies assembly problem on mRNA viruses, which is based on a correlation clustering approach and uses semidefinite optimization framework. The software accepts a reference genome, a NGS read set aligned to this reference and set of SNP locations in the form of a vcf file and outputs an optimal set of reconstructed species genomes which describes the underlying viral population. -
9
IPAS is a new and practial iterative progressive multiple sequence alignment algorithm, used to align protein sequences, which is a close variant of the MUSCEL algorithm. However, based on the gene sequences length, our algorithm starts either with the "kmer" distance table or with the "Dynamic Programming (DP)" distance table. The other steps of this algorithm include: generating a Guide-tree using UPGMA, multiple sequence alignments, "kimura" distance calculation from aligned sequences...
-
Turn Your Content into Interactive Magic - For FreeTransform anything you share into an engaging digital experience - for free. Instantly convert your PDFs, slides, and files into dynamic, interactive sessions with built-in collaboration tools, activities, and real-time assessment. From teaching to training to team building, make every presentation unforgettable. Used by millions for education, business, and professional development.
-
10
IPAS for protein sequences
multiple alignment algorithm for protein sequences
IPAS is a new and practial protein multiple sequence alignment algorithm based on iterative progresive alignment algorithm Assessed on BAliBASE 3.0, PREFAB 4.0, SABMARK 1.65, and OXBENCH, MSAProbs achieves the statistically highest alignment accuracy, compared to ClustalW 2.0.10, MAFFT 6.717( using L-INS-i with --maxiterate = 1000), MUSCLE 3.8.31, ProbCons 1.12, and Probalign 1.3. -
11
MCU Media Server
SIP Video Multiconference Media Server with WebRTC support.
REPOSITORY MOVED TO GITHUB!! https://github.com/medooze/media-server Video Multiconference Media Server with WebRTC support. Provide Multiconference and video broadcasting services to any SIP service. Supports VP8, H264, MP4V-ES, H263 and H263P, continuous presence, RTMP flash broadcasting, adhoc conferences, load balancing and administrative WEB interface. JSR309 driver implementation under development. . -
12
adapter trimmer
We implement a very simple approach. Each read is searched for the jun
We implement a very simple approach. Each read is searched for the junction adapter (CTGTCTCTTATACACATCT) and its reverse complement (AGATGTGTATAAGAGACAG) based on Hamming distance, the entire junction being CTGTCTCTTATACACATCT+AGATGTGTATAAGAGACAG. If a match to either side of the junction is found then the entire 38bp juncton is clipped. This means the algorithm can tolerate an indel error in one of the sides of the junction, but not both. Optionally Smith-Waterman alignment can be turned... -
13
3D Graphics Library for MR (VR & AR)
Experience the Reality !
This is a little Program that I have done recently, made by my Algorithm for showing 3D Objects in 2D & can be implemented on any Programming Language ( No Open Source Packages/APIs are used. ) You can build & animate whatever you want. Final version will be released soon. -
14
BISD
Batch incremental SNN-DBSCAN clustering algorithm
Incremental data mining algorithms process frequent up- dates to dynamic datasets efficiently by avoiding redundant computa- tion. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremen- tal algorithm to overcome both these bottlenecks by efficiently identify- ing affected parts of clusters while processing updates to dataset in batch... -
15
HGPEC
A tool for gene and phenotype prioritization and evidence collection
Finding gene-disease and disease-disease associations are important issues in the biomedical area and many prioritization methods have been proposed for this goal. Among these, approaches based on heterogeneous network of genes and phenotypes were considered state-of-the-art ones, which can use for diseases with/without known molecular basis. Here, we develop a Cytoscape plugin, namely HGPEC, based on a ran-dom walk with restart algorithm on a heterogeneous network of genes and phenotypes... -
16
SUPERmerge
ChIP-seq coverage island analysis algorithm for broad histone marks
SUPERmerge is a ChIP-seq read pileup analysis and annotation algorithm for investigating alignment (BAM) files of diffuse histone modification ChIP-seq datasets with broad chromatin domains at a single base pair resolution level. SUPERmerge allows flexible regulation of a variety of read pileup parameters, thereby revealing how read islands aggregate into areas of coverage across the genome and what annotation features they map to within individual biological replicates. SUPERmerge... -
17
GA-tools
general genetic algorithms optimization fortran 95 routines
High level optimization routines in Fortran 95 for optimization problems using a genetic algorithm with elitism, steady-state-reproduction, dynamic operator scoring by merit, no-duplicates-in-population. Chromosome representation may be integer-array, real-array, permutation-array, character-array. Single objective and multi-objective maximization routines are present. Possible to incorporate own crossover and mutation operators exclusively or in addition to standard operators... -
18
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
... efficiently. It is much slower than it should be. 3.) GFFT, implemented by Ben Segal and Mark Iwen. This code is less easy to use, and also not terribly efficient. But, the *algorithm* itself is significantly simpler and has "essentially no parameters". 4.) MSFFT, implemented by David Lawlor and Bosu Choi. This code is fast, but is not terribly easy to use. The algorithm is robust to some noise, but requires a lot of parameter tuning. Enjoy at your own risk :), Mark Iwen -
19
-
20
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
21
GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.
-
22
Random Bits Forest
RBF: a Strong Classifier/Regressor for Big Data
We present a classification and regression algorithm called Random Bits Forest (RBF). RBF integrates neural network (for depth), boosting (for wideness) and random forest (for accuracy). It first generates and selects ~10,000 small three-layer threshold random neural networks as basis by gradient boosting scheme. These binary basis are then feed into a modified random forest algorithm to obtain predictions. In conclusion, RBF is a novel framework that performs strongly especially on data... -
23
mailcheck.js
Reduce misspelled email addresses in your web apps
The Javascript library and jQuery plugin that suggests a right domain when your users misspell it in an email address. Mailcheck will offer up suggestions for second and top level domains too. For instant use, download the minified library mailcheck.min.js into your javascripts directory. mailcheck.js is also available unminimised if you want to hack on it, or have your own minimizer. Mailcheck takes in two callbacks, suggested and empty. We recommend you supply both. Mailcheck does not want... -
24
passgen
Passgen - easy to use, simple password generator
Passgen is easy to use, simple based on hexal and octal digits system password generator. -
25
iLib
The most comprehensive library of Javascript i18n classes available
Note: development has been moved over to github! Please see https://github.com/iLib-js/iLib "I18N" means way more than just translation. Other libraries claim to be an i18n solution when translation and string formatting is really all they offer. Yes, iLib has classes that do translation too, but there is also much, much more. From date formatting to name parsing to phone number handling to collation, iLib has classes that do it. And, it has the ability to support thousands of possible...
