Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction
We study the single individual SNP haplotype reconstruction problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful...
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 | 277 |
|---|---|
| container_issue | |
| container_start_page | 266 |
| container_title | |
| container_volume | |
| creator | Panconesi, Alessandro Sozio, Mauro |
| description | We study the single individual SNP haplotype reconstruction problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful in practical applications. We also introduce a combinatorial problem related to the SNP haplotype reconstruction problem that we call Min Element Removal. We prove its NP-hardness in the gapless case and its O(log n)-approximability in the general case. |
| doi_str_mv | 10.1007/978-3-540-30219-3_23 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16144222</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16144222</sourcerecordid><originalsourceid>FETCH-LOGICAL-c345t-4df0ce2e72537faae6298607ff99d8a7dce3aede82d68bb6795940392d8e96933</originalsourceid><addsrcrecordid>eNotkM1OwzAQhM2fRCl9Aw6-cDTY3iSOuVUVpZWqgiicLdd2KkNIIjtF6tvjNuxltTOzK-2H0B2jD4xS8ShFSYDkGSVAOZMEFIczdANJOQn0HI1YwRgByOTFYHCgrGSXaHSMECkyuEaTGL9oKkYZozBC67mOPV7o4J7wFA-D2wcfe29w1Qa88c2udnjZWP_r7V7XeLN-Swtd3faHzuF3Z9om9mFvet82t-iq0nV0k_8-Rp_z54_ZgqxeX5az6YoYyPKeZLaixnEneA6i0toVXJYFFVUlpS21sMaBdtaV3BbldlsImcv0qOS2dLKQAGN0P9ztdDS6roJujI-qC_5Hh4NKJLKMc55yfMjFZDU7F9S2bb-jYlQdsaqEVYFKrNSJojpihT_SpWU4</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction</title><source>Springer Books</source><creator>Panconesi, Alessandro ; Sozio, Mauro</creator><contributor>Kim, Junhyong ; Jonassen, Inge</contributor><creatorcontrib>Panconesi, Alessandro ; Sozio, Mauro ; Kim, Junhyong ; Jonassen, Inge</creatorcontrib><description>We study the single individual SNP haplotype reconstruction problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful in practical applications. We also introduce a combinatorial problem related to the SNP haplotype reconstruction problem that we call Min Element Removal. We prove its NP-hardness in the gapless case and its O(log n)-approximability in the general case.</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_23</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Biological and medical sciences ; Computer science; control theory; systems ; Dynamic Programming Algorithm ; Exact sciences and technology ; Fast Heuristic ; Fundamental and applied biological sciences. Psychology ; General aspects ; Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects) ; Null Entry ; Output Matrix ; Reading Error ; Theoretical computing</subject><ispartof>Algorithms in Bioinformatics, 2004, p.266-277</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c345t-4df0ce2e72537faae6298607ff99d8a7dce3aede82d68bb6795940392d8e96933</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_23$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30219-3_23$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16144222$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Kim, Junhyong</contributor><contributor>Jonassen, Inge</contributor><creatorcontrib>Panconesi, Alessandro</creatorcontrib><creatorcontrib>Sozio, Mauro</creatorcontrib><title>Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction</title><title>Algorithms in Bioinformatics</title><description>We study the single individual SNP haplotype reconstruction problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful in practical applications. We also introduce a combinatorial problem related to the SNP haplotype reconstruction problem that we call Min Element Removal. We prove its NP-hardness in the gapless case and its O(log n)-approximability in the general case.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Biological and medical sciences</subject><subject>Computer science; control theory; systems</subject><subject>Dynamic Programming Algorithm</subject><subject>Exact sciences and technology</subject><subject>Fast Heuristic</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>Null Entry</subject><subject>Output Matrix</subject><subject>Reading Error</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>eNotkM1OwzAQhM2fRCl9Aw6-cDTY3iSOuVUVpZWqgiicLdd2KkNIIjtF6tvjNuxltTOzK-2H0B2jD4xS8ShFSYDkGSVAOZMEFIczdANJOQn0HI1YwRgByOTFYHCgrGSXaHSMECkyuEaTGL9oKkYZozBC67mOPV7o4J7wFA-D2wcfe29w1Qa88c2udnjZWP_r7V7XeLN-Swtd3faHzuF3Z9om9mFvet82t-iq0nV0k_8-Rp_z54_ZgqxeX5az6YoYyPKeZLaixnEneA6i0toVXJYFFVUlpS21sMaBdtaV3BbldlsImcv0qOS2dLKQAGN0P9ztdDS6roJujI-qC_5Hh4NKJLKMc55yfMjFZDU7F9S2bb-jYlQdsaqEVYFKrNSJojpihT_SpWU4</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Panconesi, Alessandro</creator><creator>Sozio, Mauro</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction</title><author>Panconesi, Alessandro ; Sozio, Mauro</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c345t-4df0ce2e72537faae6298607ff99d8a7dce3aede82d68bb6795940392d8e96933</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Biological and medical sciences</topic><topic>Computer science; control theory; systems</topic><topic>Dynamic Programming Algorithm</topic><topic>Exact sciences and technology</topic><topic>Fast Heuristic</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>Null Entry</topic><topic>Output Matrix</topic><topic>Reading Error</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Panconesi, Alessandro</creatorcontrib><creatorcontrib>Sozio, Mauro</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Panconesi, Alessandro</au><au>Sozio, Mauro</au><au>Kim, Junhyong</au><au>Jonassen, Inge</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction</atitle><btitle>Algorithms in Bioinformatics</btitle><date>2004</date><risdate>2004</risdate><spage>266</spage><epage>277</epage><pages>266-277</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540230181</isbn><isbn>9783540230182</isbn><eisbn>3540302190</eisbn><eisbn>9783540302193</eisbn><abstract>We study the single individual SNP haplotype reconstruction problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful in practical applications. We also introduce a combinatorial problem related to the SNP haplotype reconstruction problem that we call Min Element Removal. We prove its NP-hardness in the gapless case and its O(log n)-approximability in the general case.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30219-3_23</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Algorithms in Bioinformatics, 2004, p.266-277 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16144222 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Biological and medical sciences Computer science control theory systems Dynamic Programming Algorithm Exact sciences and technology Fast Heuristic Fundamental and applied biological sciences. Psychology General aspects Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects) Null Entry Output Matrix Reading Error Theoretical computing |
| title | Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T17%3A10%3A38IST&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=Fast%20Hare:%20A%20Fast%20Heuristic%20for%20Single%20Individual%20SNP%20Haplotype%20Reconstruction&rft.btitle=Algorithms%20in%20Bioinformatics&rft.au=Panconesi,%20Alessandro&rft.date=2004&rft.spage=266&rft.epage=277&rft.pages=266-277&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_23&rft_dat=%3Cpascalfrancis_sprin%3E16144222%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 |