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

Comparing Assemblies Using Fragments and Mate-Pairs

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

DOI10.1007/3-540-44696-6_23zbMath1129.92306OpenAlexW1506202754MaRDI QIDQ4801169

Knut Reinert, Aaron L. Halpern, Eugene W. Myers, Granger G. Sutton III, Zhongwu Lai, Daniel H. Huson

Publication date: 6 April 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44696-6_23



Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)


Related Items

A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem ⋮ An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs ⋮ A practical parameterised algorithm for the individual haplotyping problem MLF



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