Needleman, S. B., and Wunsch, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Ppfs: An Experimental File System For High Performance Parallel .. - Huber, Jr. (1995) (2 citations) (Correct)
....error prone, approximate matching algorithms are employed to find similar sequences. We experimented with a parallel FORTRAN program 3 which uses a generalized Needleman, Wunsch, and Sellars (NWS) sequence comparison algorithm. This dynamic programming algorithm, developed by Needleman and Wunsch [22], finds optimal sequence alignments. Enhancements made by Sellers find good local alignments of subsequences [27] A K tuple heuristic [31] is used to prune the search space and compensate 3 This code was originally developed for the Cray X MP by Dan Davidson. 44 for the quadratic time of the ....
Needleman, S. B., and Wunsch, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453.
Automatic Classification Of Input/Output Access Patterns - Madhyastha (1997) (Correct)
....file in any order cannot express this flexibility through a file system with a byte stream interface. Relaxing this constraint for applications can dramatically improve performance by allowing the file system to balance load and optimize throughput. Consider the Needleman, Wunch and Sellers (NWS) [58] dynamic programming algorithm for parallel genome matching, which is implemented by having each processor independently compare a test genome sequence against disjoint portions of the sequence database. Significant speedups can be obtained by structuring this database so that processors can ....
Needleman, S. B., and Wunsch, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453.
Performance Analysis Of Parallel Systems Using Virtual Reality - Shields (1994) (1 citation) (Correct)
....against a genome database stored on the Paragon s I O subsystem. The sequence matching is based on a generalization of the Needleman, Wunsch, and Sellers (NWS) sequence comparison algorithm in conjunction with a k tuple heuristic to improve the overall performance of the sequencing process [26] [40] 1] The NWS algorithm uses a dynamic programming approach to determine how well aligned (matched) two sequences are. Each sequence in the database is compared in turn to the input genome sequence. The elements of these two sequences are compared in pairwise fashion. A recurrence relation is ....
Needleman, S. B., and Wunsch, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453.
PPFS: A High Performance Portable Parallel File System - Huber, Jr., Elford, Reed, .. (1995) (61 citations) (Correct)
....currently used to determine genetic sequences produce non trivial numbers of errors, exact string matching algorithms are inappropriate for biological sequences. This code uses an approximate sequence matching approach is based on a generalization of the Needleman, Wunsch, and Sellers (NWS) [20] dynamic programming algorithm, with a K tuple heuristic to improve performance. 4 The input sequence is processed against all entries in the genome data base, and the data base entry that results in the best score is declared the best match for the input sequence. In the native parallel ....
Needleman, S. B., and Wunsch, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453.
Virtual Reality and Parallel Systems Performance Analysis - Reed (1995) (23 citations) (Correct)
....synthesis methods currently used to determine genetic sequences produce non trivial numbers of errors, exact string matching algorithms are inappropriate for biological sequences. One approximate sequence matching approach is based on a generalization of the Needleman, Wunsch, and Sellers (NWS) [6] dynamic programming algorithm, with a K tuple heuristic to improve 7 In Figure 8, dark red indicates the old value of the control variable. performance. 8 The NWS algorithm uses dynamic programming to determine the minimum set of changes needed to bring two (presumably) related sequences ....
Needleman, S. B., and Wunsch, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453.
Informed Prefetching of Collective Input/Output Requests - Madhyastha, Gibson, Faloutsos (1999) (3 citations) (Correct)
No context found.
NEEDLEMAN, S. B., AND WUNSCH, C. D. An Efficient Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 48 (1970), 444--453.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC