Smith, T.F., and Waterman, M.S., "Identification of Common Molecular Subsequences." Journal of Molecular Biology, 147: 195--197, 1981. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Aligning Sequences with Non-Affine Gap Penalty: - Plains Algorithm Practical (Correct)
No context found.
Smith, T.F., and Waterman, M.S., "Identification of Common Molecular Subsequences." Journal of Molecular Biology, 147: 195--197, 1981.
A Parallel Wavefront Algorithm for Ecient - Biological Sequence Comparison (Correct)
No context found.
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. J. Mol. Bio., (147):195--197, 1981.
Biosequence Similarity Search on the Mercury System - Krishnamurthy, Buhler.. (2004) (1 citation) (Correct)
No context found.
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195--97, March 1981.
Spectral Clustering of Biological Sequence Data - William Pentney Department (Correct)
No context found.
Smith, T., and Waterman, M. 1981. Identification of common molecular subsequences. Journal of Molecular Biology 147:195--197.
Parallel Dynamic Programming for Solving the String.. - Ftce Universidade Ao (Correct)
No context found.
T. F. Smith and M. S. Wate r an. Identification of common molecular subsequences. J. Mol. Bio., (147):195--197, 1981.
Dealing with Hardware Space Limits When Removing.. - Giraud, Lavenier (2005) (Correct)
No context found.
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 221:403--420, 1981.
Journal of Machine Learning Research 5 (2004) 27-72.. - Gert Lanckriet Gert (Correct)
No context found.
Smith, T. F. and Waterman, M. S. (1981). Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195--197.
Bioinformatics - Vol No Pages (Correct)
No context found.
Smith,T.F. and Waterman,M.S. (1981) The identification of common molecular subsequences. J. Mol. Biol., 147, 195--197.
Bioinformatics - Vol No Pages (Correct)
No context found.
Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195--197.
PSIST: Indexing Protein Structures using Suffix Trees - Feng Gao And (Correct)
No context found.
F. Smith and M. Waterman. Identification of common molecular subsequences. J. Mol. Biol., (147):195--197, 1981.
Question Answering with QED at TREC-2005 - Kisuh Ahn Johan (Correct)
No context found.
T. F. Smith and M. S. Waterman. 1981. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195--197.
Speeding Up Whole-Genome Alignment by Indexing Frequency.. - Kahveci, Ljosa, Singh (2004) (Correct)
No context found.
Smith,T. and Waterman,M. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195--197.
Rapid Homology Search with Two-Stage Extension and Daughter Seeds - Ma (2005) (Correct)
No context found.
Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195--197
Bioinformatics on a Heterogeneous Java Distributed System - Page, Keane, Naughton (2005) (Correct)
No context found.
T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-- 197, 1981.
Improved hit criteria for DNA local alignment - Noe, Kucherov (2004) (2 citations) (Correct)
No context found.
SMITH, T., AND WATERMAN, M. Identification of common molecular subsequences. Journal of Molecular Biology 147, 195--197 (March 1981).
A Parallel Wavefront Algorithm for Ecient - Biological Sequence Comparison (Correct)
No context found.
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. J. Mol. Bio., (147):195--197, 1981.
Investigation of Local-Alignment Search for Large.. - Using Suffix Trees (Correct)
No context found.
T. Smith, M. Waterman. Identification of Common Molecular Subsequences. Journal of Molecular Biology 1981, 195--197.
Estimating Seed Sensitivity on Homogeneous Alignments - Kucherov, Noé, Ponty (5 citations) (Correct)
No context found.
T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(195-- 197), Mar 1981.
A High-Throughput Bioinformatics Distributed Computing.. - Keane, Page, McInerney, .. (2005) (Correct)
No context found.
Smith, T.F. and Waterman, M.S., "Identification of common molecular subsequences", Journal of Molecular Biology, 1981, 147, 195-197
Rapid Homology Search with Neighbor Seeds - Csürös, Ma (2005) (Correct)
No context found.
Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195--197
Models and Scheduling Mechanisms for Global Computing.. - Kondo, Casanova, Wing.. (2002) (2 citations) (Correct)
No context found.
T.F. Smith and M.S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195--197, 1981.
Algorithms for Finding Maximal-Scoring Segment Sets (Extended.. - Csürös (Correct)
No context found.
Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147 (1981) 195--197
YASS: enhancing the sensitivity of DNA similarity search - Noe, Kucherov (2005) (Correct)
No context found.
Smith,T. and Waterman,M. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195--197.
Parallel Dynamic Programming for Solving the String.. - Ftce Universidade Ao (Correct)
No context found.
T. F. Smith and M. S. Wate r an. Identification of common molecular subsequences. J. Mol. Bio., (147):195--197, 1981.
Approximate String Joins in a Database (Almost) for Free - Gravano, Ipeirotis.. (2001) (Correct)
No context found.
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. In Journal of Molecular Biology, 147:195--197, 1981.
First 50 documents Next 50
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