SIGN IN
SIGN UP
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms
Full Text:
PDF
Buy this Article
Authors:
Jacek Blazewicz
Edmund Burke
Marta Kasprzak
Alexandr Kovalev
Mikhail Kovalyov
2007 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 12
· Downloads (cumulative): 175
· Citation Count: 1
Published in:
· Journal
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
TCBB Homepage
archive
Volume 4 Issue 4, October 2007
Pages 668-680
IEEE Computer Society Press
Los Alamitos, CA
, USA
table of contents
doi>
10.1109/TCBB.2007.1060
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm design and analysis, dynamic programming, genome mapping, restriction site analysis, imprecise information
algorithms
biology and genetics
computations on discrete structures
design
design methodology
dynamic programming
sequencing and scheduling
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder