%0 Conference Paper %1 conf/recomb/LaiSD17 %A Lai, Han %A Stolzer, Maureen %A Durand, Dannie %B RECOMB-CG %D 2017 %E Meidanis, Joao %E Nakhleh, Luay %I Springer %K dblp %P 298-320 %T Fast Heuristics for Resolving Weakly Supported Branches Using Duplication, Transfers, and Losses. %U http://dblp.uni-trier.de/db/conf/recomb/recomb-cg2017.html#LaiSD17 %V 10562 %@ 978-3-319-67979-2

@inproceedings{conf/recomb/LaiSD17, added-at = {2019-05-13T00:00:00.000+0200}, author = {Lai, Han and Stolzer, Maureen and Durand, Dannie}, biburl = {https://www.bibsonomy.org/bibtex/25cec586d21e32a71b151b4066e3f546c/dblp}, booktitle = {RECOMB-CG}, crossref = {conf/recomb/2017cg}, editor = {Meidanis, Joao and Nakhleh, Luay}, ee = {https://doi.org/10.1007/978-3-319-67979-2_16}, interhash = {4c722f733df7c76ce9139f2e128c9bd0}, intrahash = {5cec586d21e32a71b151b4066e3f546c}, isbn = {978-3-319-67979-2}, keywords = {dblp}, pages = {298-320}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-14T11:38:28.000+0200}, title = {Fast Heuristics for Resolving Weakly Supported Branches Using Duplication, Transfers, and Losses.}, url = {http://dblp.uni-trier.de/db/conf/recomb/recomb-cg2017.html#LaiSD17}, volume = 10562, year = 2017 }