ACM Home Page
Please provide us with feedback. Feedback
Segment-based approach for subsequence searches in sequence databases
Full text PdfPdf (147 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2001 ACM symposium on Applied computing table of contents
Las Vegas, Nevada, United States
Pages: 248 - 252  
Year of Publication: 2001
ISBN:1-58113-287-5
Authors
Sanghyun Park  Department of Computer Science, University of California, Los, Angeles, Los Angeles, CA
Sang-Wook Kim  Department of Computer, Information, and Communications Engineering, Kangwon National University, Korea
Wesley W. Chu  Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 22,   Citation Count: 13
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/372202.372334
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
5
 
6
 
7
S. Park, S. Kim, and W. W. Chu. Segment-based approach for subsequence searches in sequence databases. In Technical Report of UCLA Computer Science Dept. (UCLA-CSD-TR-200022), 2000.
 
8
 
9
 
10
11
 
12

CITED BY  13

Collaborative Colleagues:
Sanghyun Park: colleagues
Sang-Wook Kim: colleagues
Wesley W. Chu: colleagues