Normal view MARC view ISBD view

Parallel Algorithms For Planted(l, d) Motif Search Problems

Mohanty, Satarupa

Parallel Algorithms For Planted(l, d) Motif Search Problems - 131p.

Subjects--Topical Terms:
Computer Science

Dewey Class. No.: 004 MOH

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)