{"id":"https://openalex.org/W2611121916","doi":"https://doi.org/10.1089/106652700750050970","title":"Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm","display_name":"Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm","publication_year":2000,"publication_date":"2000-08-01","ids":{"openalex":"https://openalex.org/W2611121916","doi":"https://doi.org/10.1089/106652700750050970","mag":"2611121916"},"language":"en","primary_location":{"id":"doi:10.1089/106652700750050970","is_oa":false,"landing_page_url":"https://doi.org/10.1089/106652700750050970","pdf_url":null,"source":{"id":"https://openalex.org/S78571599","display_name":"Journal of Computational Biology","issn_l":"1066-5277","issn":["1066-5277","1557-8666"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320443","host_organization_name":"Mary Ann Liebert, Inc.","host_organization_lineage":["https://openalex.org/P4310320443"],"host_organization_lineage_names":["Mary Ann Liebert, Inc."],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112789186","display_name":"Franco P. Preparata","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Franco P. Preparata","raw_affiliation_strings":["Computer Science Department, Brown University, 115 Waterman Street, Providence, RI 02912-1910"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brown University, 115 Waterman Street, Providence, RI 02912-1910","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028869858","display_name":"Eli Upfal","orcid":"https://orcid.org/0000-0002-9321-9460"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Upfal","raw_affiliation_strings":["Computer Science Department, Brown University, 115 Waterman Street, Providence, RI 02912-1910"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brown University, 115 Waterman Street, Providence, RI 02912-1910","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112789186"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":19.3727,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.99551355,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"7","issue":"3-4","first_page":"621","last_page":"630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8087999820709229,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8087999820709229,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.774399995803833,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.7742999792098999,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5062974691390991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4650880694389343},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44350510835647583},{"id":"https://openalex.org/keywords/computational-biology","display_name":"Computational biology","score":0.3686493933200836},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.3212813436985016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2704128921031952}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5062974691390991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4650880694389343},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44350510835647583},{"id":"https://openalex.org/C70721500","wikidata":"https://www.wikidata.org/wiki/Q177005","display_name":"Computational biology","level":1,"score":0.3686493933200836},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.3212813436985016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2704128921031952},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1089/106652700750050970","is_oa":false,"landing_page_url":"https://doi.org/10.1089/106652700750050970","pdf_url":null,"source":{"id":"https://openalex.org/S78571599","display_name":"Journal of Computational Biology","issn_l":"1066-5277","issn":["1066-5277","1557-8666"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320443","host_organization_name":"Mary Ann Liebert, Inc.","host_organization_lineage":["https://openalex.org/P4310320443"],"host_organization_lineage_names":["Mary Ann Liebert, Inc."],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Biology","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.3325","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/2000/Preparata-2000-SHA.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.6769","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.6769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/~melkman/AdvancedAlgorithms/projects/SBHoptimal.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1493192698","https://openalex.org/W1986088012","https://openalex.org/W1998971063","https://openalex.org/W2044220140","https://openalex.org/W2077095651","https://openalex.org/W2112780289"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2082860237","https://openalex.org/W2119695867","https://openalex.org/W2130076355","https://openalex.org/W1990804418","https://openalex.org/W1993764875","https://openalex.org/W2046158694","https://openalex.org/W2788277189","https://openalex.org/W2013243191","https://openalex.org/W1971568933"],"abstract_inverted_index":{"In":[0,80],"a":[1,10,30,55,63,87,117],"recent":[2],"paper":[3,82],"(Preparata":[4,38],"et":[5,39],"al.,":[6,40],"1999)":[7,41],"we":[8,83],"introduced":[9],"novel":[11],"probing":[12],"scheme":[13,23,48,75],"for":[14,93],"DNA":[15],"sequencing":[16,91],"by":[17],"hybridization":[18],"(SBH).":[19],"The":[20],"new":[21,101],"gapped-probe":[22,47,95],"combines":[24],"natural":[25],"and":[26,85],"universal":[27],"bases":[28],"in":[29,137],"well-defined":[31],"periodic":[32],"pattern.":[33],"It":[34],"has":[35],"been":[36],"shown":[37],"that":[42,57,99,114],"the":[43,46,52,73,94,100,104,108,124,138],"performance":[44,113,129],"of":[45,51,54,67,107,123],"(in":[49],"terms":[50],"length":[53],"sequence":[56,140],"can":[58],"be":[59],"uniquely":[60],"reconstructed":[61],"using":[62],"given":[64],"size":[65],"library":[66],"probes)":[68],"is":[69,130],"significantly":[70],"better":[71],"than":[72],"standard":[74],"based":[76],"on":[77],"oligomer":[78],"probes.":[79],"this":[81,128],"present":[84],"analyze":[86],"new,":[88],"more":[89],"powerful,":[90],"algorithm":[92,102],"scheme.":[96],"We":[97],"prove":[98],"exploits":[103],"full":[105],"potential":[106],"SBH":[109],"technology":[110],"with":[111],"high-confidence":[112],"comes":[115],"within":[116],"small":[118],"constant":[119],"factor":[120],"(about":[121],"2)":[122],"information-theory":[125],"bound.":[126],"Moreover,":[127],"achieved":[131],"while":[132],"maintaining":[133],"running":[134],"time":[135],"linear":[136],"target":[139],"length.":[141]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}