Cantalloube H, Labesse G, Chomilier J, Nahum C, Cho Y Y, Chams V, Achour A, Lachgar A, Mbika J P, Issing W
Laboratoire de Physiologie Cellulaire, Université P. et M. Curie, Paris, France.
Comput Appl Biosci. 1995 Jun;11(3):261-72. doi: 10.1093/bioinformatics/11.3.261.
Since the early 1980s, protein/DNA sequence similarity search has become of major importance to biologists, and the need for fast and efficient tools grows with the size of databanks. Two programs use the strategy of finite state deterministic automatons to accomplish these searches. One of these two is BLAST, which is now widely used, and the other Automat, which has just been published. The differences and similarities in their basic principles, their use and their performances are analysed in this paper in order to allow optimal use of these important softwares.
自20世纪80年代初以来，蛋白质/DNA序列相似性搜索对生物学家来说变得至关重要，并且随着数据库规模的扩大，对快速高效工具的需求也在增加。有两个程序采用有限状态确定性自动机策略来完成这些搜索。这两个程序中的一个是现在广泛使用的BLAST，另一个是刚发表的Automat。本文分析了它们在基本原理、用途和性能方面的异同，以便能最佳地使用这些重要软件。
