Full metadata record
DC FieldValueLanguage
dc.contributor.authorHwang, FKen_US
dc.contributor.authorLin, WDen_US
dc.date.accessioned2014-12-08T15:40:01Z-
dc.date.available2014-12-08T15:40:01Z-
dc.date.issued2003-12-01en_US
dc.identifier.issn1382-6905en_US
dc.identifier.urihttp://dx.doi.org/10.1023/B:JOCO.0000017381.11696.c6en_US
dc.identifier.urihttp://hdl.handle.net/11536/27333-
dc.description.abstractIn this paper, we propose the incremental group testing model for the gap closing problem, which assumes that we can tell the difference between the outcome of testing a subset S, and the outcome of testing Sboolean OR{x}. We also give improvements over currently best results in literature for some other models.en_US
dc.language.isoen_USen_US
dc.subjectcontig sequencingen_US
dc.subjectgap closingen_US
dc.subjectgroup testingen_US
dc.subjectmultiplex PCRen_US
dc.subjectdetecting matrixen_US
dc.subjectseparating matrixen_US
dc.subjectaffine plane methoden_US
dc.titleThe incremental group testing model for gap closing in sequencing long moleculesen_US
dc.typeArticleen_US
dc.identifier.doi10.1023/B:JOCO.0000017381.11696.c6en_US
dc.identifier.journalJOURNAL OF COMBINATORIAL OPTIMIZATIONen_US
dc.citation.volume7en_US
dc.citation.issue4en_US
dc.citation.spage327en_US
dc.citation.epage337en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000189208100001-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000189208100001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.