A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals
One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 61 |
|---|---|
| container_issue | |
| container_start_page | 50 |
| container_title | |
| container_volume | |
| creator | Hartman, Tzvika Sharan, Roded |
| description | One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into the other. In this paper we provide a 1.5-approximation algorithm for the problem of sorting by transpositions and transreversals, improving on a five years old 1.75 ratio for this problem. Our algorithm is also faster than current approaches and requires \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$O(n^{3/2} \sqrt{\log{n}})$\end{document} time for n genes. |
| doi_str_mv | 10.1007/978-3-540-30219-3_5 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16144215</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16144215</sourcerecordid><originalsourceid>FETCH-LOGICAL-c277t-f78391b9b8838664f8cf65fd5b5c2241b2646071e4849949d43d3c6ce8f9803e3</originalsourceid><addsrcrecordid>eNotkE1PwzAMhsOXxBj7BVxy4ZgR12mbHKuJAdIEB8Y56kcyCltTJRVi_550xRfbr19Z9kPIHfAlcJ4_qFwyZKngDHkCiqFOz8gNRuHU83MygwyAIQp1MQ0S5CDhksxGC1O5wGuyCOGLxwAOwHFGXgsKy5QVfe_db3soh9Z1tNjvnG-HzwO1ztN354e229HqSLe-7ELvQjvaAi27ZpK8-TE-lPtwS65sTGbxn-fkY_24XT2zzdvTy6rYsDrJ84HZXKKCSlVSoswyYWVts9Q2aZXWSSKgSjKR8RyMkEIpoRqBDdZZbaRVkqPBObmf9vZlqMu9jUfUbdC9jy_4o44khEggjT6YfCGOup3xunLuO2jgeqSqI1UdSQquTxTHGv8ATa1klg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals</title><source>Springer Books</source><creator>Hartman, Tzvika ; Sharan, Roded</creator><contributor>Kim, Junhyong ; Jonassen, Inge</contributor><creatorcontrib>Hartman, Tzvika ; Sharan, Roded ; Kim, Junhyong ; Jonassen, Inge</creatorcontrib><description>One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into the other. In this paper we provide a 1.5-approximation algorithm for the problem of sorting by transpositions and transreversals, improving on a five years old 1.75 ratio for this problem. Our algorithm is also faster than current approaches and requires \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$O(n^{3/2} \sqrt{\log{n}})$\end{document} time for n genes.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540230181</identifier><identifier>ISBN: 9783540230182</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540302190</identifier><identifier>EISBN: 9783540302193</identifier><identifier>DOI: 10.1007/978-3-540-30219-3_5</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>14th Annual Symposium ; Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Biological and medical sciences ; Black Edge ; Breakpoint Graph ; Canonical Labelling ; Computer science; control theory; systems ; Exact sciences and technology ; Fundamental and applied biological sciences. Psychology ; General aspects ; Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects) ; Signed Permutation ; Theoretical computing</subject><ispartof>Algorithms in Bioinformatics, 2004, p.50-61</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c277t-f78391b9b8838664f8cf65fd5b5c2241b2646071e4849949d43d3c6ce8f9803e3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30219-3_5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30219-3_5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16144215$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Kim, Junhyong</contributor><contributor>Jonassen, Inge</contributor><creatorcontrib>Hartman, Tzvika</creatorcontrib><creatorcontrib>Sharan, Roded</creatorcontrib><title>A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals</title><title>Algorithms in Bioinformatics</title><description>One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into the other. In this paper we provide a 1.5-approximation algorithm for the problem of sorting by transpositions and transreversals, improving on a five years old 1.75 ratio for this problem. Our algorithm is also faster than current approaches and requires \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$O(n^{3/2} \sqrt{\log{n}})$\end{document} time for n genes.</description><subject>14th Annual Symposium</subject><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Biological and medical sciences</subject><subject>Black Edge</subject><subject>Breakpoint Graph</subject><subject>Canonical Labelling</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Fundamental and applied biological sciences. Psychology</subject><subject>General aspects</subject><subject>Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects)</subject><subject>Signed Permutation</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540230181</isbn><isbn>9783540230182</isbn><isbn>3540302190</isbn><isbn>9783540302193</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkE1PwzAMhsOXxBj7BVxy4ZgR12mbHKuJAdIEB8Y56kcyCltTJRVi_550xRfbr19Z9kPIHfAlcJ4_qFwyZKngDHkCiqFOz8gNRuHU83MygwyAIQp1MQ0S5CDhksxGC1O5wGuyCOGLxwAOwHFGXgsKy5QVfe_db3soh9Z1tNjvnG-HzwO1ztN354e229HqSLe-7ELvQjvaAi27ZpK8-TE-lPtwS65sTGbxn-fkY_24XT2zzdvTy6rYsDrJ84HZXKKCSlVSoswyYWVts9Q2aZXWSSKgSjKR8RyMkEIpoRqBDdZZbaRVkqPBObmf9vZlqMu9jUfUbdC9jy_4o44khEggjT6YfCGOup3xunLuO2jgeqSqI1UdSQquTxTHGv8ATa1klg</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Hartman, Tzvika</creator><creator>Sharan, Roded</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals</title><author>Hartman, Tzvika ; Sharan, Roded</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c277t-f78391b9b8838664f8cf65fd5b5c2241b2646071e4849949d43d3c6ce8f9803e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>14th Annual Symposium</topic><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Biological and medical sciences</topic><topic>Black Edge</topic><topic>Breakpoint Graph</topic><topic>Canonical Labelling</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Fundamental and applied biological sciences. Psychology</topic><topic>General aspects</topic><topic>Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects)</topic><topic>Signed Permutation</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hartman, Tzvika</creatorcontrib><creatorcontrib>Sharan, Roded</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hartman, Tzvika</au><au>Sharan, Roded</au><au>Kim, Junhyong</au><au>Jonassen, Inge</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals</atitle><btitle>Algorithms in Bioinformatics</btitle><date>2004</date><risdate>2004</risdate><spage>50</spage><epage>61</epage><pages>50-61</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540230181</isbn><isbn>9783540230182</isbn><eisbn>3540302190</eisbn><eisbn>9783540302193</eisbn><abstract>One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into the other. In this paper we provide a 1.5-approximation algorithm for the problem of sorting by transpositions and transreversals, improving on a five years old 1.75 ratio for this problem. Our algorithm is also faster than current approaches and requires \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$O(n^{3/2} \sqrt{\log{n}})$\end{document} time for n genes.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30219-3_5</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Algorithms in Bioinformatics, 2004, p.50-61 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16144215 |
| source | Springer Books |
| subjects | 14th Annual Symposium Algorithmics. Computability. Computer arithmetics Applied sciences Biological and medical sciences Black Edge Breakpoint Graph Canonical Labelling Computer science control theory systems Exact sciences and technology Fundamental and applied biological sciences. Psychology General aspects Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects) Signed Permutation Theoretical computing |
| title | A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T13%3A04%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%201.5-Approximation%20Algorithm%20for%20Sorting%20by%20Transpositions%20and%20Transreversals&rft.btitle=Algorithms%20in%20Bioinformatics&rft.au=Hartman,%20Tzvika&rft.date=2004&rft.spage=50&rft.epage=61&rft.pages=50-61&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540230181&rft.isbn_list=9783540230182&rft_id=info:doi/10.1007/978-3-540-30219-3_5&rft_dat=%3Cpascalfrancis_sprin%3E16144215%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540302190&rft.eisbn_list=9783540302193&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |