SCOPUS 정보 검색 플랫폼

Computers in Biology and Medicine

Volumn 35, Issue 2, 2005, Pages 173-181

On exact string matching of unique oligonucleotides

(3) Hyyrö, Heikki a Juhola, Martti a Vihinen, Mauno b

a TAMPERE UNIVERSITY OF TECHNOLOGY (Finland)

b UNIVERSITY OF TAMPERE (Finland)

Author keywords

DNA sequences; Exact string matching; Genomic data sequences; Keyword tree (trie); Oligonucleotides

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DNA; ENZYME KINETICS; GENETIC ENGINEERING; PROBLEM SOLVING; REACTION KINETICS;

OLIGONUCLEOTIDES; POLYMER CHAIN REACTION; STRING MATCHING ALGORITHMS;

OLIGOMERS;

OLIGONUCLEOTIDE;

ARTICLE; DNA MICROARRAY; DNA SEQUENCE; EXACT STRING MATCHING ALGORITHM; GENE TECHNOLOGY; GENETIC ALGORITHM; GENETIC ANALYSIS; GENOMICS; INTERMETHOD COMPARISON; MOLECULAR CLONING; NUCLEOTIDE SEQUENCE; POLYMERASE CHAIN REACTION; PRIORITY JOURNAL; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS; THEORETICAL MODEL; YEAST;

ALGORITHMS; DNA, FUNGAL; OLIGONUCLEOTIDES; SACCHAROMYCES CEREVISIAE; SEQUENCE ALIGNMENT;

EID: 9644263964 PISSN: 00104825 EISSN: None Source Type: Journal
DOI: 10.1016/j.compbiomed.2003.11.003 Document Type: Article

Times cited : (9)

References (17)

1
- 9644273150
- National Center for Biotechnology Information, web site: http://www.ncbi.nlm.nih.gov.

2
- 10544256600
- Expression monitoring by hybridization to high-density oligonucleotide arrays
- Lockhart D.J., Dong H., Byrne M.C., Follettie M.T., Gallo M.V., Mittmann M.S.M., Wang C., Kobayashi M., Brown H.E.L. Expression monitoring by hybridization to high-density oligonucleotide arrays. Nature Biotechnol. 14:1996;1675-1680
- (1996) Nature Biotechnol. , vol.14 , pp. 1675-1680
- Lockhart, D.J.¹ Dong, H.² Byrne, M.C.³ Follettie, M.T.⁴ Gallo, M.V.⁵ Mittmann, M.S.M.⁶ Wang, C.⁷ Kobayashi, M.⁸ Brown, H.E.L.⁹

3
- 0031453850
- Genome-wide expression monitoring in Saccharomyces cerevisiae
- Wodicka L., Dong H., Mittmann M., Ho M., Lockhart D.J. Genome-wide expression monitoring in Saccharomyces cerevisiae. Nature Biotechnol. 15:1997;1359
- (1997) Nature Biotechnol. , vol.15 , pp. 1359
- Wodicka, L.¹ Dong, H.² Mittmann, M.³ Ho, M.⁴ Lockhart, D.J.⁵

4
- 0016518897
- Efficient string matching: An aid to bibliographic search
- Aho A., Corasick M. Efficient string matching. an aid to bibliographic search Commun. ACM. 18:1975;333-340
- (1975) Commun. ACM , vol.18 , pp. 333-340
- Aho, A.¹ Corasick, M.²

5
- 0022030599
- Efficient randomized pattern matching algorithms
- Karp R., Rabin M. Efficient randomized pattern matching algorithms. IBM J. Res. Develop. 31:1987;249-260
- (1987) IBM J. Res. Develop. , vol.31 , pp. 249-260
- Karp, R.¹ Rabin, M.²

6
- 0003893064
- Singapore: World Scientific
- Stephen G.A. String Searching Algorithms. 1994;World Scientific, Singapore
- (1994) String Searching Algorithms
- Stephen, G.A.¹

7
- 0004137004
- Cambridge: Cambridge University Press
- Gusfield D. Algorithms on Strings, Trees and Sequences: Computers Science and Computational Biology. 1997;Cambridge University Press, Cambridge
- (1997) Algorithms on Strings, Trees and Sequences: Computers Science and Computational Biology
- Gusfield, D.¹

8
- 0004722024
- Technical Report 40, University California, Berkeley
- J.H. Morris, V.R. Pratt, A linear pattern-matching algorithm, Technical Report 40, University California, Berkeley, 1970.
- (1970) A Linear Pattern-matching Algorithm
- Morris, J.H.¹ Pratt, V.R.²

9
- 0004189992
- New York: Oxford University Press
- Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, New York
- (1994) Text Algorithms
- Crochemore, M.¹ Rytter, W.²

10
- 0000904908
- Fast pattern matching in strings
- Knuth D.E., Morris J.H., Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6:1977;323-350
- (1977) SIAM J. Comput. , vol.6 , pp. 323-350
- Knuth, D.E.¹ Morris, J.H.² Pratt, V.R.³

11
- 0017547820
- A fast string searching algorithm
- Boyer R.S., Moore J.S. A fast string searching algorithm. Commun. ACM. 20:1977;762-772
- (1977) Commun. ACM , vol.20 , pp. 762-772
- Boyer, R.S.¹ Moore, J.S.²

12
- 0000839459
- A correct preprocessing algorithm for Boyer-Moore string searching
- Rytter W. A correct preprocessing algorithm for Boyer-Moore string searching. SIAM J. Comput. 9:1980;509-512
- (1980) SIAM J. Comput. , vol.9 , pp. 509-512
- Rytter, W.¹

13
- 0028516714
- Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm
- Cole R. Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm. SIAM J. Comput. 23:1994;1075-1091
- (1994) SIAM J. Comput. , vol.23 , pp. 1075-1091
- Cole, R.¹

14
- 84984028908
- Practical fast searching in strings
- Horspool N. Practical fast searching in strings. Software Practice and Experience. 10:1980;501-506
- (1980) Software Practice and Experience , vol.10 , pp. 501-506
- Horspool, N.¹

15
- 0025467860
- A very fast substring search algorithm
- Sunday D.M. A very fast substring search algorithm. Commun. ACM. 33:1990;132-142
- (1990) Commun. ACM , vol.33 , pp. 132-142
- Sunday, D.M.¹

16
- 0029344516
- Experimental results on string matching algorithms
- Lecroq T. Experimental results on string matching algorithms. Software Practice and Experience. 25:1995;710-728
- (1995) Software Practice and Experience , vol.25 , pp. 710-728
- Lecroq, T.¹

17
- 0025183708
- Basic local alignment search tool
- Altschul S.F., Gish W., Miller W., Myers E.W., Lipman D.J. Basic local alignment search tool. J. Mol. Biol. 215:1990;403-410
- (1990) J. Mol. Biol. , vol.215 , pp. 403-410
- Altschul, S.F.¹ Gish, W.² Miller, W.³ Myers, E.W.⁴ Lipman, D.J.⁵

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.