Jones R
Thinking Machines Corporation, Cambridge, MA 02142.
Comput Appl Biosci. 1992 Aug;8(4):377-83. doi: 10.1093/bioinformatics/8.4.377.
A method is described for finding all occurrences of a sequence pattern within a database of molecular sequences. Implementation of this on a massively parallel computer allows the user to perform very fast database searches using complex patterns. In particular, the software supports approximate pattern matching with score thresholds for either the entire pattern or specified elements thereof. Matches to individual elements can be linked by variable length gaps within user-specified limits.
本文描述了一种在分子序列数据库中查找序列模式所有出现位置的方法。在大规模并行计算机上实现此方法,可让用户使用复杂模式非常快速地进行数据库搜索。特别是,该软件支持对整个模式或其指定元素进行带分数阈值的近似模式匹配。对各个元素的匹配可以通过用户指定范围内的可变长度间隙进行链接。