"A Space-Bounded Anytime Algorithm for the Multiple Longest Common ..."

Jiaoyun Yang et al. (2014)

> Home

Details and statistics

DOI: 10.1109/TKDE.2014.2304464

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  authority control:
- export record
  dblp key:
  - journals/tkde/YangXSC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkde/YangXSC14
Jiaoyun Yang, Yun Xu, Yi Shang, Guoliang Chen:
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem. IEEE Trans. Knowl. Data Eng. 26(11): 2599-2609 (2014)

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.