Full metadata record
DC FieldValueLanguage
dc.contributor.authorLu, WFen_US
dc.contributor.authorHsu, WLen_US
dc.date.accessioned2014-12-08T15:41:36Z-
dc.date.available2014-12-08T15:41:36Z-
dc.date.issued2003en_US
dc.identifier.isbn3-540-40205-5en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/28281-
dc.description.abstractAn interval graph is the intersection graph of a collection of intervals. One important application of interval graph is physical mapping in genome research, that is, to reassemble the clones to determine the relative position of fragments of DNA along the genome. The linear time algorithm by Booth and Lueker (1976) for this problem has a serious drawback: the data must be error-free. However, laboratory work is never flawless. We devised a new iterative clustering algorithm for this problem, which can accommodate noisy data and produce a likely interval model realizing the original graph.en_US
dc.language.isoen_USen_US
dc.titleA clustering algorithm for interval graph test on noisy dataen_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalEXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGSen_US
dc.citation.volume2647en_US
dc.citation.spage195en_US
dc.citation.epage208en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000184816600016-
Appears in Collections:Conferences Paper