"Finding Longest Common Segments in Protein Structures in Nearly Linear Time."

Yen Kaow Ng et al. (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-31265-6_27

access: closed

type: Conference or Workshop Paper

metadata version: 2023-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpm/NgOGL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/NgOGL12
Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li:
Finding Longest Common Segments in Protein Structures in Nearly Linear Time. CPM 2012: 334-348

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.