摘要: Protein database searches frequently can reveal biologically significant sequence relationships useful in understanding structure and function. Weak but meaningful patterns be obscured, however, by other similarities due only to chance. By searching a for multiple as opposed pairwise alignments, distant are much more easily distinguished from background noise. Recent statistical results permit the power of this approach analyzed. Given typical query sequence, an algorithm described here permits current protein searched three-sequence alignments less than 4 min. Such have revealed variety subtle that search methods would unable detect.