-
1
-
-
0025183708
-
Basic local alignment search tool
-
S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
-
(1990)
Journal of Molecular Biology
, vol.215
, pp. 403-410
-
-
Altschul, S.F.1
Gish, W.2
Miller, W.3
Myers, E.W.4
Lipman, D.J.5
-
2
-
-
0029355897
-
ESTablishing a human transcript map
-
M. Boguski and G. Schuler. ESTablishing a human transcript map. Nature Genetics, 10(11):369-371, 1995.
-
(1995)
Nature Genetics
, vol.10
, Issue.11
, pp. 369-371
-
-
Boguski, M.1
Schuler, G.2
-
3
-
-
0032703998
-
D2_cluster: A validated method for clustering EST and full-length cDNA sequences
-
J. Burke, D. Davison, and W. Hide. D2_cluster: A validated method for clustering EST and full-length cDNA sequences. Genome Research, 9(11):1135-1142, 1999.
-
(1999)
Genome Research
, vol.9
, Issue.11
, pp. 1135-1142
-
-
Burke, J.1
Davison, D.2
Hide, W.3
-
4
-
-
0035172129
-
STACKdb: Sequence tag alignment and consensus knowledgebase
-
A. Christoffels, A. van Gelder, G. Grayling, R. Miller, T. Hide, and W. Hide. STACKdb: Sequence tag alignment and consensus knowledgebase. Nucleic Acids Research, pages 234-238, 2001.
-
(2001)
Nucleic Acids Research
, pp. 234-238
-
-
Christoffels, A.1
Van Gelder, A.2
Grayling, G.3
Miller, R.4
Hide, T.5
Hide, W.6
-
5
-
-
0027942048
-
GenFrag 2.1: New features for more robust fragment assembly benchmarks
-
M. Engle and C. Burks. GenFrag 2.1: new features for more robust fragment assembly benchmarks. Computer Applications in the Biosciences, 10(5):567-568, 1994.
-
(1994)
Computer Applications in the Biosciences
, vol.10
, Issue.5
, pp. 567-568
-
-
Engle, M.1
Burks, C.2
-
6
-
-
0032645274
-
An algorithm for clustering cD-NAs for gene expression analysis
-
ACM
-
E. Hartuv, A. Schmitt, J. Lange, S. Meier-Ewert, H. Lehrach, and R. Shamir. An algorithm for clustering cD-NAs for gene expression analysis. In Proc. Int. Conf. Comp. Mol. Biol. (RECOMB 99), pages 188-196. ACM, 1999.
-
(1999)
Proc. Int. Conf. Comp. Mol. Biol. (RECOMB 99)
, pp. 188-196
-
-
Hartuv, E.1
Schmitt, A.2
Lange, J.3
Meier-Ewert, S.4
Lehrach, H.5
Shamir, R.6
-
7
-
-
4544343744
-
ESTSim: A tool for creating benchmarks for EST clustering algorithms
-
School of Computer Science, University of the Wirwatersrand
-
S. Hazelhurst and A. Bergheim. ESTSim: A tool for creating benchmarks for EST clustering algorithms. Technical Report TR-Wits-CS-2003-1, School of Computer Science, University of the Wirwatersrand, 2003. ftp://ftp.os.wits.ac.za/pub/research/ reports/TR-Wits-CS-2003-1.pdf.
-
(2003)
Technical Report
, vol.TR-WITS-CS-2003-1
-
-
Hazelhurst, S.1
Bergheim, A.2
-
8
-
-
0004239905
-
-
W. Hide, R. Miller, A. Ptitsyn, J. Kelso, C. Gopalkrishnan, and A. Christoffels. EST Clustering Tutorial, 1999.
-
(1999)
EST Clustering Tutorial
-
-
Hide, W.1
Miller, R.2
Ptitsyn, A.3
Kelso, J.4
Gopalkrishnan, C.5
Christoffels, A.6
-
9
-
-
84893405732
-
Data clustering: A review
-
A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Camp. Surveys, 31(3):264-323, 1999.
-
(1999)
ACM Camp. Surveys
, vol.31
, Issue.3
, pp. 264-323
-
-
Jain, A.K.1
Murty, M.N.2
Flynn, P.J.3
-
11
-
-
0037790561
-
Efficient clustering of large EST data sets on parallel computers
-
A. Kalyanaraman, S. Aluru, S. Kothari, and V. Brendel. Efficient clustering of large EST data sets on parallel computers. Nucleic Acids Research, 31(11):2963-2974, 2003.
-
(2003)
Nucleic Acids Research
, vol.31
, Issue.11
, pp. 2963-2974
-
-
Kalyanaraman, A.1
Aluru, S.2
Kothari, S.3
Brendel, V.4
-
12
-
-
0034666168
-
An optimized protocol for analysis of EST sequences
-
F. Liang, I. Holt, G. Pertea, S. Karamycheva, S. Salzberg, and J. Quackenbush. An optimized protocol for analysis of EST sequences. Nucleic Acids Research, 26(18):3657-3665, 2000.
-
(2000)
Nucleic Acids Research
, vol.26
, Issue.18
, pp. 3657-3665
-
-
Liang, F.1
Holt, I.2
Pertea, G.3
Karamycheva, S.4
Salzberg, S.5
Quackenbush, J.6
-
13
-
-
0038494602
-
Fast sequence clustering using a suffix array algorithm
-
K. Malde, E. Coward, and I. Jonassen. Fast sequence clustering using a suffix array algorithm. Bioinformatics, 19(10):1221-1226, 2003.
-
(2003)
Bioinformatics
, vol.19
, Issue.10
, pp. 1221-1226
-
-
Malde, K.1
Coward, E.2
Jonassen, I.3
-
15
-
-
0345566149
-
A guided tour to approximate string matching
-
G. Navarro. A Guided Tour to Approximate String Matching. ACM Computing Surveys, 33(1):31-88, 2001.
-
(2001)
ACM Computing Surveys
, vol.33
, Issue.1
, pp. 31-88
-
-
Navarro, G.1
-
16
-
-
0037460985
-
TIGR gene indices clustering tools (TGICL): A software system for fast clustering of large EST datasets
-
G. Pertea, X. Huang, F. Liang, V. Antonescu, R. Sultana, S. Karamycheva, Y. Lee, J. White, F. Cheung, B. Parvizi, J. Tsai, and I. Quackenbush. TIGR gene indices clustering tools (TGICL): a software system for fast clustering of large EST datasets. Bioinformatics, 19(5):651-652, 2003.
-
(2003)
Bioinformatics
, vol.19
, Issue.5
, pp. 651-652
-
-
Pertea, G.1
Huang, X.2
Liang, F.3
Antonescu, V.4
Sultana, R.5
Karamycheva, S.6
Lee, Y.7
White, J.8
Cheung, F.9
Parvizi, B.10
Tsai, J.11
Quackenbush, I.12
-
17
-
-
0035165581
-
The TIGR gene indices: Analysis of gene transcript sequences in higly sampled eukaryotic species
-
J. Quackenbush, J. Cho, D. Lee, F. Liang, I. Holt, S. Karmycheva, B. Parviyi, G. Pertea, R. Sultana, and J. White. The TIGR gene indices: analysis of gene transcript sequences in higly sampled eukaryotic species. Nucleic Acids Research, 29(1):159-164, 2001.
-
(2001)
Nucleic Acids Research
, vol.29
, Issue.1
, pp. 159-164
-
-
Quackenbush, J.1
Cho, J.2
Lee, D.3
Liang, F.4
Holt, I.5
Karmycheva, S.6
Parviyi, B.7
Pertea, G.8
Sultana, R.9
White, J.10
-
18
-
-
85170194974
-
2: A measure of sequence dissimilarity
-
G. Bell and T. Marr, editors. Addison-Wesley
-
2: A measure of sequence dissimilarity. In G. Bell and T. Marr, editors, Computers and DNA, pages 109-125. Addison-Wesley, 1990.
-
(1990)
Computers and DNA
, pp. 109-125
-
-
Torney, D.1
Burks, C.2
Davison, D.3
Sirotkin, K.M.4
-
19
-
-
0027113212
-
Approximate string-matching with q-grams and maximal matches
-
E. Ukkonen. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92:191-211, 1992.
-
(1992)
Theoretical Computer Science
, vol.92
, pp. 191-211
-
-
Ukkonen, E.1
-
20
-
-
0037342499
-
Alignment-free sequence comparison - A review
-
S. Vinga and J. Almeida. Alignment-free sequence comparison - a review. Bioinformatics, 19(3):513-524, 2003.
-
(2003)
Bioinformatics
, vol.19
, Issue.3
, pp. 513-524
-
-
Vinga, S.1
Almeida, J.2
-
21
-
-
84862416819
-
A method for evaluating the quality of string dissimilarity measures and clustering algorithms for EST clustering
-
School of Computer Science, University of the Witwatersrand, Mar.
-
J. Zimmerman, Z. Lipták, and S. Hazelhurst. A Method for Evaluating the Quality of String Dissimilarity Measures and Clustering Algorithms for EST Clustering. Technical Report TR-Wits-CS-2004-0, School of Computer Science, University of the Witwatersrand, Mar. 2004. ftp://ftp.cs.wits.ac.za/pub/research/reports/TR-Wits-CS-2004-0.pdf.
-
(2004)
Technical Report
, vol.TR-WITS-CS-2004-0
-
-
Zimmerman, J.1
Lipták, Z.2
Hazelhurst, S.3
|