Search Results for "c algorithms"
Sort By:
Showing 52 open source projects for "c algorithms"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
Gemi
PCR primers / probes design from multiple & degenerate sequences
Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional PCR (qPCR, rt-PCR, etc.), and Sanger sequencing. Gemi can parse large dataset of sequences efficiently. Python source code is available upon request. Milestone:... -
2
PANDA
A comprehensive and flexible quantification tool for proteomics data
PANDA is a comprehensive and flexib tool for quantitative proteomics data analysis, which is developed based on our solid foundations in quantitative proteomics for years. Several novelties have been implemented in it. First, we implement the advantage algorithms of LFQuant (Proteomics 2012, 12, (23-24), 3475-84) and SILVER (Bioinformatics 2014, 30, (4), 586-7) into PANDA. Second, we consider the state-of-art concept of quantification reliability in this quantitative workflow. On the levels... -
3
AstroBioTools
Adaptive analysis of amino acid alphabets
A new, fast implementation of algorithms used for the adaptive analysis of amino acid alphabets as described in Philip, G. K., & Freeland, S. J. (2011). Did evolution select a nonrandom “alphabet” of amino acids? Astrobiology, 11(3), 235-240. Ilardo, M., Meringer, M., Freeland, S., Rasulev, B., & Cleaves II, H. J. (2015). Extraordinarily adaptive properties of the genetically encoded amino acids. -
4
This project hosts a library and tools for sharing simulation experiments encoded using SED-ML.
-
Build Securely on AWS 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.
-
5
An open source framework for LC-MS based proteomics and metabolomics. OpenMS offers data structures and algorithms for the processing of mass spectrometry data. The library is written in C++. Our source code and wiki lives on GitHub (https://github.com/OpenMS/OpenMS).
-
6
This project, initially developed at University College London, contains programs to perform rigid, affine and non-linear registration of nifti or analyse images. Two versions of the algorithms are included, a CPU- and a GPU- (using CUDA) based implementation.
-
7
This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
-
8
CognitionMaster
object-based image analysis framework
Wienert S, Heim D, Kotani M, Lindequist B, Stenzinger A, Ishii M, Hufnagl P, Beil M, Dietel M, Denkert C, Klauschen F. CognitionMaster: an object-based image analysis framework. Diagn Pathol 2013, 8:34 -
9
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. -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
10
detectMITE
Detection of Miniature Inverted Repeat Transposable Elements
detectMITE - a MATLAB-based tool for detecting miniature inverted repeat transposable elements (MITEs) in genomes. [1] Who are we? Please visit website: http://bioinfolab.miamioh.edu [2] How to cite detectMITE? Ye C, Ji G, Liang C (2016) detectMITE: A novel approach to detect miniature inverted repeat transposable elements in genomes. Sci. Rep. 6, 19688. http://www.nature.com/articles/srep19688 Ye C, Ji G, Li L, Liang C (2014) detectIR: A Novel Program for Detecting Perfect... -
11
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. -
12
ShuffleFastaSeq
This application can be used to shuffle sequences in FASTA format.
ShuffleFastaSeq is a Windows form application, written in C#, to shuffle FASTA-formatted sequences. The random permutation is obtained using a simple variation of the Fisher-Yates alghorithm implemented by Durstenfeld (https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle) ( Knuth DE. The art of computer programming: seminumerical algorithms. 3rd ed. Boston: Addison-Wesley; 1997). The input file contains one or more sequences in FASTA format. -
13
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... -
14
FieldTrip
The MATLAB software toolbox for MEG and EEG analysis
FieldTrip is the Matlab toolbox for EEG and MEG data. It includes algorithms for simple and advanced analysis, such as importing, preprocessing, time-frequency analysis, source reconstruction, statistical testing and connectivity analysis. -
15
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 source under the permissive MIT License. -
16
The General Hidden Markov Model Library (GHMM) is a C library with additional Python bindings implementing a wide range of types of Hidden Markov Models and algorithms: discrete, continous emissions, basic training, HMM clustering, HMM mixtures.
-
17
MDA
Molecular Dynamics Analyzer (MDA)
MDA is a 3D single-particle tracking software that explicitly addresses fluorescence microscopy experiments deep in living specimens. It is capable of minimizing the systematic error that occurs with astigmatism-based 3D techniques owing to the aberrations induced by the refractive index mismatch. In contrast to existing techniques, the method determines the aberration directly from the acquired 2D image stream by exploiting the inherent particle movement and the redundancy introduced by the... -
18
detectIR
Detection of Perfect and Imperfect Inverted Repeats
detectIR - a MATLAB-based tool for detecting perfect and imperfect inverted repeats in genomes. [1] Who are we? Please visit website: http://bioinfolab.miamioh.edu [2] How to cite detectIR? Ye C, Ji G, Li L, Liang C (2014) detectIR: A Novel Program for Detecting Perfect and Imperfect Inverted Repeats Using Complex Numbers and Vector Calculation. PLoS ONE 9(11): e113349. http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0113349 [3] detectIR user manual... -
19
SBSI (Systems Biology Software Infrastructure) is a suite of tools for systems biology, such as parallelized numerical algorithms, and a Java, Eclipse RCP based client for visualizing results, running simulations, and integrating SBML based plugins.
-
20
math lib for .NET. n-dim arrays, complex numbers, linear algebra, FFT, sorting, cells- and logical arrays as well as 3D plotting classes help developing algorithms on every platform supporting .NET. Sources from SVN, binaries: http://ilnumerics.net
-
21
Online Signature Verification
Real time signature verification using MATLAB and C#
Online Signature Verification technology requires primarily a digitizing tablet and a special pen connected to the USB port of a computer. An individual can sign on the digitizing tablet using the special pen regardless of his signature size and position. The signature is characterized as pen-strokes consisting x-y coordinates and pressure with the data being stored in a signature database. Dynamic time warping (DTW) and quadratic discriminant analysis (QDA) is used to get results where the... -
22
Phylogenetic software that implements the algorithms "Fast Computation of Distance Estimators" and "Fast Neighbor Joining".
-
23
cmotif
A method for mining conditional phosphorylation motifs
Phosphorylation motifs represent position-specific amino acid patterns around the phosphorylation sites in the set of phosphopeptides. The discovery of phosphorylation motifs is a very valuable work in bioinformatics. Although several algorithms have been proposed to uncover phosphorylation motifs, the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. In this paper, we propose an algorithm called C-Motif for a non-redundant identification of significant phosphorylation motifs. In tests with real data including both non-kinase-specific and kinase-specific phosphorylation data, the C-Motif algorithm successfully reports a relatively complete set of of conditional phosphorylation motifs efficiently. -
24
GraFIX is a software and a method to detect fixations in low and high quality data, consisting of a two-step process in which eye-tracking data is initially parsed by using adaptive velocity-based algorithms, before it is hand-coded using the graphical interface, allowing accurate and rapid adjustments of the algorithms' outcome. GraFIX is released under the GPLv3 public license (http://www.gnu.org/licenses/). Please cite as: Saez de Urabain, I.R., Johnson, M.H., Smith, T.J., (2014)...
-
25
GaloisExplorer provides a user-friendly interface for basic functionalities of Formal Concept Analysis (FCA) with different lattice generation algorithms and an interactive viewer to explore a 3-dimensionally laid out lattice.