Making Short Work of Short Sequence Search

Mistakes to Avoid for Short Sequence Searching This white paper explains why BLAST falls short on short sequence searches, and presents alternatives to BLAST that overcome these limitations and deliver accurate, definitive short sequence results in minutes.
Learn More»

Understanding the patent landscape around biological sequences can be a very complex and time consuming process. ARYx has adopted GenomeQuest™...
More About Our Customers »

Applications: Short Sequence Searching

Even experienced researchers encounter frustrating delays during short sequence search projects, often spending more hours than anticipated seeking conclusive answers to their queries.

The problems stem from the unsuitability of BLAST and other popular heuristic search algorithms for short sequence searches. Attempting to "tune” BLAST for short sequences usually results in iterative searching, more lost time, and long search result printouts requiring close scrutiny and manual sorting.

GenomeQuest provides a number of heuristic and non-heuristic search algorithms so that the right one is available when special search needs arise. The non-heuristic GenePAST algorithm is extremely effective for short sequence searches. GenePAST compares query and subject sequences according to similarity, rather than homology. GenePAST has no complicated algorithm parameter settings and is extremely easy to use. Search results are pre-sorted according to percent identity between query and subject sequences. GenePAST makes short work of short sequence searching.