Search Results for "smith waterman"
Sort By:
Showing 20 open source projects for "smith waterman"
View related business solutions-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
CUDASW++: Smith-Waterman Algorithm
The fastest Smith-Waterman protein database search algorithm on GPUs
CUDASW++ software is a public open source software for Smith-Waterman protein database searches on Graphics Processing Units with CUDA. This software have been added to the NVIDIA Tesla Bio Workbench (http://www.nvidia.com/object/swplusplus_on_tesla.html -
2
adapter trimmer
We implement a very simple approach. Each read is searched for the jun
...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 on with -w which resolves this issue, although the code is less tested. eg. this will be caught: CTGTCTCT-TA-TACACATCTAGATGTGTATAAGAGACAG but not this: CTGTCTCT-TA-TACACATCTAGATGT-GTATAAGAGACAG -
3
SW#
smith waterman, gpu, cuda, alignment
SW# (swsharp) is a library for sequence alignment based on CUDA enabled GPUs. It utilizes Hirschbergs and Ukkonens algorithm for memory efficiency and additional speed up. The library is scalable for use with multiple GPUs. Some parts of the library utilize MPI for CUDA enabled clusters. This work has been supported in part by Croatian Science Foundation under the project UIP-11-2013-7353. Database search now... -
4
BABA stands for Basic-Algorithms-of-Bioinformatics Applet. This project aims to create a set of bioinformatic algorithms presented didactically. The algorithms available at the moment are: Needleman&Wunsch, Smith&Waterman, Four Russians and Nussinov.
-
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.
-
5
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. -
6
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. -
7
CUDAlign
CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs
CUDAlign is a tool able to align pairwise DNA sequences of unrestricted size in CUDA GPUs, using the Smith-Waterman algorithm combined with Myers-Miller. It produces the optimal alignment of 1 million base sequences in 45 seconds using a GTX 560 Ti. Many optimizations are being developed for this software. Look at the following papers for detailed information: [1] Edans Sandes, Alba Melo. Retrieving Smith-Waterman Alignments with Optimizations for Megabase Biological Sequences using GPU. ... -
8
...The given sequences are aligned by Sequence Alignment methodology - arranging sequences of DNA, RNA, protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences. The sequence Alignment is done by using The Smith-waterman algorithm - a general local alignment method also based on dynamic programming. In this project user has an option to save sequence in either of these formats. FASTA format or CLUSTAL format.Medical Fields can make use of this application .
-
9
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/ -
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.
-
10
Swift Sequence Alignment Program
GPU-based DNA sequence alignment program using Smith-Waterman
Swift is a DNA sequence alignment program that produces gapped alignment using the Smith-Waterman algorithm. It takes in a query file (FASTA format) and a reference file (FASTA format) as input. It outputs the reference name, read name, gapped alignment, alignment score, alignment start and end positions, and alignment length. I gave a talk on Swift in the GPU Technology Conference 2012. The talk can be accessed at http://www.gputechconf.com/gtcnew/on-demand-GTC.php?... -
11
SmithWaterman
Fast local sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align An implementation of the Smith-Waterman local sequence alignment algorithm. See our sister project global alignment using Needleman-Wunsch: http://sourceforge.net/projects/needlemanwunsch/ -
12
JFinisher
JFinisher is software for alignment, editing and manipulation DNA seqs
JFinisher is software for alignment, editing and manipulation of biological sequences. It aims to assist in the finishing of genome assembly. Starting from a reference sequence, the program align contigs using Smith-Waterman local alignment algoritm with auxiliary methods, allowing management of the alignments generated. It has graphical interface for manipulation and visualization of the actions, uniting features that help in editing the sequences. It has internal projects manageable and ability to export results in the standard formats of the area. -
13
A log anomaly detector tool which uses a modified Smith Waterman algorithm to identify matching (or non-matching) messages, against archived syslog messages in real time.
-
14
-
15
Multi-functional batch sequence aligner incorporating Needleman-Wunsch, Smith-Waterman and Oommen-Kashyap algorithms along with compound alignment of secondary sequences.
-
16
An efficient implementation of the Smith-Waterman algorithm that takes advantage of SIMD instruction sets in modern CPUs. The Smith-Waterman algorithm is used for sequence alignment in bioinformatics.
-
17
-
18
JAligner is an open source Java implementation of the dynamic programming algorithm Smith-Waterman with Gotoh's improvement for biological local pairwise sequence alignment with the affine gap penalty model.
-
19
NeoBio is a Java class library of Computational Biology Algorithms. The current version consists mainly of pairwise sequence alignment algorithms such as the classical dynamic programming methods of Needleman-Wunsch and Smith-Waterman.
-
20
Bioinformatics program for analysing two (currently) or more (in the future) protein sequences and compare them using a Smith-Waterman and/or Needleman-Wunsch algorithms. Also set on gathering inherent statistical analysis from the process and displaying
- Previous
- You're on page 1
- Next
