.png){kind=icon}
返回
Time-efficient parallel algorithms for the longest common subsequence and related problems
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1999.1534.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently Akl et al. introduced a new model of parallel computation, called broadcasting with selective reduction (BSR), and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix, and other problems. In this paper, we describe constant time solutions to the longest common subsequence problem and the sequence alignment problem using the BSR model. These are the first constant time solutions to these problems for any model of computation. (C) 1999 Academic Press, Inc.
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
.png){kind=icon}
