An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm

From MaRDI portal

Publication:1191625

Jump to:navigation, search

zbMath0745.92019MaRDI QIDQ1191625

Eugene W. Myers, Xiaoqiu Huang

Publication date: 27 September 1992

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

zbMATH Keywords

search algorithm sparse dynamic programming restriction maps restriction enzymes DNA strand recognition sites restriction map comparison

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items (2)

Linear-space algorithms that build local alignments from fragments ⋮ Chaining algorithms for multiple genome comparison

This page was built for publication: An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1191625&oldid=13246879"