Basic Local Alignment Search Tool 2.2.19 (Default branch)


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News Basic Local Alignment Search Tool 2.2.19 (Default branch)
# 1  
Old 12-18-2008
Basic Local Alignment Search Tool 2.2.19 (Default branch)

BLAST is a set of similarity search programs designed to explore all of the available sequence databases regardless of whether the query is protein or DNA. It uses a heuristic algorithm which seeks local as opposed to global alignments, and is therefore able to detect relationships among sequences which share only isolated regions of similarity. It can be run locally as a full executable, and can be used to run BLAST searches against private, local databases, or downloaded copies of the NCBI databases. It runs on Mac OS, Win32, LINUX, Solaris, IBM AIX, SGI, Compaq OSF, and HP- UX systems. License: Open Software License Changes:
The BLASTDB environment variable now supports multiple database search paths. When possible, a smaller protein lookup table is used to improve performance. formatrpsdb now supports creating databases larger than 2G. seedtop now supports searches with gi lists. The X3 value for blastn/megablast was corrected. Image

Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

2 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Alignment tool to join text files in 2 directories to create a parallel corpus

I have two directories called English and Hindi. Each directory contains the same number of files with the only difference being that in the case of the English Directory the tag is .english and in the Hindi one the tag is .Hindi The file may contain either a single text or more than one text... (7 Replies)
Discussion started by: gimley
7 Replies

2. Shell Programming and Scripting

Help needed with basic search

hi, im trying to find the longest word in /usr/share/dict/words that does not contain the letter i. i've tried using the wc -L command like so: $ wc -L /usr/share/dict/words which basically tells me the longest word which is good but how do i get the longest word which Does not contain the... (7 Replies)
Discussion started by: tryintolearn
7 Replies
Login or Register to Ask a Question
Search::GIN::Query::Set(3pm)				User Contributed Perl Documentation			      Search::GIN::Query::Set(3pm)

NAME
Search::GIN::Query::Set - Create queries with set operations VERSION
version 0.08 SYNOPSIS
# build a query like: # (type:pdf OR type:png) AND (name:Homer OR name:Bart) use Search::GIN::Query::Set; use Search::GIN::Query::Manual; my $query = Search::GIN::Query::Set->new( operation => 'INTERSECT', subqueries => [ Search::GIN::Query::Manual->new( values => { type => [qw(pdf png)] } ), Search::GIN::Query::Manual->new( values => { name => [qw(Homer Bart)] } ), ] ); DESCRIPTION
Creates a manual GIN query that can be used to search using basic set theory, in order to build more complex queries. This query doesn't provide any specific search, it's just a set operator for subqueries. You can build complex queries by using other set queries as subqueries for a set query. METHODS
/SUBROUTINES new Creates a new query. ATTRIBUTES
subqueries The subqueries to process operation One of the basic set operators: "UNION", "INTERSECT" and "EXCEPT". The default is "UNION" AUTHOR
Yuval Kogman <nothingmuch@cpan.org> COPYRIGHT AND LICENSE
This software is copyright (c) 2010 by Yuval Kogman, Infinity Interactive. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. perl v5.10.1 2011-01-31 Search::GIN::Query::Set(3pm)