Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A fast algorithm for the partial digest problem

From MaRDI portal
Publication:645279
Jump to:navigation, search

DOI10.1007/s13160-011-0041-1zbMath1226.92023OpenAlexW2053840591MaRDI QIDQ645279

Mohammad Ganjtabesh, Hassan Salehi Fathabadi, Reza Nadimi

Publication date: 14 November 2011

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-011-0041-1


zbMATH Keywords

restriction site mapping


Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Biophysics (92C05) Computational methods for problems pertaining to biology (92-08) Theory of computing (68Q99)


Related Items (1)

A new dynamic programming algorithm for the simplified partial digest problem



Cites Work

  • Partial digest is hard to solve for erroneous input data
  • A partial digest approach to restriction site mapping
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A fast algorithm for the partial digest problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:645279&oldid=12549012"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki