{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:50:29Z","timestamp":1729644629181,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/bibe.2004.1317390","type":"proceedings-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T13:50:22Z","timestamp":1096379422000},"page":"545-552","source":"Crossref","is-referenced-by-count":0,"title":["A mutation-sensitive approach for locating conserved gene pairs between related species"],"prefix":"10.1109","author":[{"given":"H.L.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.W.","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.K.","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.W.H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.M.","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"A special case of the maximal common subsequence problem","volume":"tr 170","author":"szymanski","year":"1975","journal-title":"Technical Report"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/14.8.715"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1101\/gr.10.4.577"},{"journal-title":"The MUMMER Web Site","year":"2003","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","author":"pevzner","year":"2000","journal-title":"Computational Molecular Biology - An Algorithmic Approach"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/300515.300516"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24587-2_38"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1101\/gr.10.8.1071"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019528280X"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250627"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00092-9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/30.11.2478"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/27.11.2369"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796313477"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019731994X"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"9"},{"key":"8","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/S0304-3975(01)00338-3","article-title":"(1 + ?)-Approximation of sorting by reversals and transpositions","volume":"289","author":"eriksen","year":"2002","journal-title":"Theoretical Computer Science"}],"event":{"name":"Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering","acronym":"BIBE-04","location":"Taichung, Taiwan"},"container-title":["Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9200\/29175\/01317390.pdf?arnumber=1317390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T06:26:40Z","timestamp":1585895200000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1317390\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/bibe.2004.1317390","relation":{},"subject":[]}}