Skip to main content
English
Čeština
Deutsch
Español
Français
GÃ idhlig
Latviešu
Magyar
Nederlands
Português
Português do Brasil
Suomi
Log In
Email address
Password
Log in
Have you forgotten your password?
Home
Browse Our Collection
Researchers
Scholarly Output
Consultancy/Projects
Statistics
Log In
Email address
Password
Log in
Have you forgotten your password?
Home
Faculties / Institutes
Faculty of Information and Communication Technology
Published Scholarly Output
Finding Longest Common Segments in Protein Structures in Nearly Linear Time
Details
Export
Statistics
Options
Show all metadata (technical view)
Finding Longest Common Segments in Protein Structures in Nearly Linear Time
Journal
Lecture Notes in Computer Science
Combinatorial Pattern Matching
ISSN
0302-9743
Date Issued
2012
Author(s)
Yen Kaow Ng
Hirotaka Ono
Ling Ge
Shuai Cheng Li
DOI
10.1007/978-3-642-31265-6_27
File(s)
Loading...
Download
Name
Book & Book Chapter.png
Size
3.55 KB
Format
PNG
Checksum
(MD5):5fec37418b95e97f6e56d2a5d4565331
