@InProceedings{moret02inversion,
  author    = {Bernard M. E. Moret and Adam C. Siepel and Jijun Tang and Tao Liu},
  title     = {Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data},
  booktitle = {Proc. of Workshop on Algorithms in Bioinformatics (WABI 2002)},
  year      = {2002},
  volume    = {2452},
  series    = lncs,
  pages     = {521--536},
  publisher = Springer,
  abstract  = {Phylogeny reconstruction from gene-order data has attracted much attention over the last few years. The two software packages used for that purpose, BPAnalysis and GRAPPA, both use so-called breakpoint medians in their computations. Some of our past results indicate that using inversion scores rather than breakpoint scores in evaluating trees leads to the selection of better trees. On that basis, we conjectured that phylogeny reconstructions could be improved by using inversion medians, which minimize evolutionary distance under an inversions-only model of genome rearrangement. Recent algorithmic developments have made it possible to compute inversion medians for problems of realistic size. [...]},
  file      = {MoretEtAl_InversionMediansOutperformBreakpointMedians_WABI_2002.pdf:2002/MoretEtAl_InversionMediansOutperformBreakpointMedians_WABI_2002.pdf:PDF},
  isbn      = {3-540-44211-1},
}

{"_id":"Cg9b8oF8SW8rLbySj","bibbaseid":"moret-siepel-tang-liu-inversionmediansoutperformbreakpointmediansinphylogenyreconstructionfromgeneorderdata-2002","authorIDs":[],"author_short":["Moret, B. M. E.","Siepel, A. C.","Tang, J.","Liu, T."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Bernard","M.","E."],"propositions":[],"lastnames":["Moret"],"suffixes":[]},{"firstnames":["Adam","C."],"propositions":[],"lastnames":["Siepel"],"suffixes":[]},{"firstnames":["Jijun"],"propositions":[],"lastnames":["Tang"],"suffixes":[]},{"firstnames":["Tao"],"propositions":[],"lastnames":["Liu"],"suffixes":[]}],"title":"Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data","booktitle":"Proc. of Workshop on Algorithms in Bioinformatics (WABI 2002)","year":"2002","volume":"2452","series":"Lect Notes Comput Sci","pages":"521–536","publisher":"Springer, Berlin","abstract":"Phylogeny reconstruction from gene-order data has attracted much attention over the last few years. The two software packages used for that purpose, BPAnalysis and GRAPPA, both use so-called breakpoint medians in their computations. Some of our past results indicate that using inversion scores rather than breakpoint scores in evaluating trees leads to the selection of better trees. On that basis, we conjectured that phylogeny reconstructions could be improved by using inversion medians, which minimize evolutionary distance under an inversions-only model of genome rearrangement. Recent algorithmic developments have made it possible to compute inversion medians for problems of realistic size. [...]","file":"MoretEtAl_InversionMediansOutperformBreakpointMedians_WABI_2002.pdf:2002/MoretEtAl_InversionMediansOutperformBreakpointMedians_WABI_2002.pdf:PDF","isbn":"3-540-44211-1","bibtex":"@InProceedings{moret02inversion,\n author = {Bernard M. E. Moret and Adam C. Siepel and Jijun Tang and Tao Liu},\n title = {Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data},\n booktitle = {Proc. of Workshop on Algorithms in Bioinformatics (WABI 2002)},\n year = {2002},\n volume = {2452},\n series = lncs,\n pages = {521--536},\n publisher = Springer,\n abstract = {Phylogeny reconstruction from gene-order data has attracted much attention over the last few years. The two software packages used for that purpose, BPAnalysis and GRAPPA, both use so-called breakpoint medians in their computations. Some of our past results indicate that using inversion scores rather than breakpoint scores in evaluating trees leads to the selection of better trees. On that basis, we conjectured that phylogeny reconstructions could be improved by using inversion medians, which minimize evolutionary distance under an inversions-only model of genome rearrangement. Recent algorithmic developments have made it possible to compute inversion medians for problems of realistic size. [...]},\n file = {MoretEtAl_InversionMediansOutperformBreakpointMedians_WABI_2002.pdf:2002/MoretEtAl_InversionMediansOutperformBreakpointMedians_WABI_2002.pdf:PDF},\n isbn = {3-540-44211-1},\n}\n\n","author_short":["Moret, B. M. E.","Siepel, A. C.","Tang, J.","Liu, T."],"key":"moret02inversion","id":"moret02inversion","bibbaseid":"moret-siepel-tang-liu-inversionmediansoutperformbreakpointmediansinphylogenyreconstructionfromgeneorderdata-2002","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.419Z","downloads":0,"keywords":[],"search_terms":["inversion","medians","outperform","breakpoint","medians","phylogeny","reconstruction","gene","order","data","moret","siepel","tang","liu"],"title":"Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data","year":2002,"dataSources":["C5FtkvWWggFfMJTFX"]}