Exact and kernelization algorithms for Closet String
In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an NP-hard problem. This paper proposes two line...
Uloženo v:
| Vydáno v: | Selecciones matemáticas : revista científica del Departamento Académico de Matemáticas Ročník 7; číslo 2; s. 257 - 266 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Universidad Nacional de Trujillo
30.12.2020
|
| Témata: | |
| ISSN: | 2411-1783, 2411-1783 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an NP-hard problem. This paper proposes two linear-time algorithms, one for the general case, a kernelization algorithm, and the other for three-strings, a linear-time algorithm called Minimization First Algorithm (MFA). A formal proof of the correctness and the computational complexity of the proposed algorithms are given.
En este artículo abordamos el problema de la subsecuencia de caracteres más próxima que surge en la búsqueda web, la teoría de la codificación y la biología molecular computacional. Para resolverlo debe se encontrar una subsecuencia de caracteres que minimice la distancia de Hamming máxima de un conjunto dado de subsecuencias, dicho problema está en NP-hard. Este artículo propone dos algoritmos de tiempo lineal, uno para el caso general, un algoritmo de kernelización, y el otro para tres subsecuencias de caracteres, un algoritmo de tiempo lineal llamado Algoritmo de la primera minimización (MFA). Se expresa una prueba formal para verificar la corrección y complejidad computacional de los algoritmos propuestos. |
|---|---|
| AbstractList | In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an NP-hard problem. This paper proposes two linear-time algorithms, one for the general case, a kernelization algorithm, and the other for three-strings, a linear-time algorithm called Minimization First Algorithm (MFA). A formal proof of the correctness and the computational complexity of the proposed algorithms are given. In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an NP-hard problem. This paper proposes two linear-time algorithms, one for the general case, a kernelization algorithm, and the other for three-strings, a linear-time algorithm called Minimization First Algorithm (MFA). A formal proof of the correctness and the computational complexity of the proposed algorithms are given. En este artículo abordamos el problema de la subsecuencia de caracteres más próxima que surge en la búsqueda web, la teoría de la codificación y la biología molecular computacional. Para resolverlo debe se encontrar una subsecuencia de caracteres que minimice la distancia de Hamming máxima de un conjunto dado de subsecuencias, dicho problema está en NP-hard. Este artículo propone dos algoritmos de tiempo lineal, uno para el caso general, un algoritmo de kernelización, y el otro para tres subsecuencias de caracteres, un algoritmo de tiempo lineal llamado Algoritmo de la primera minimización (MFA). Se expresa una prueba formal para verificar la corrección y complejidad computacional de los algoritmos propuestos. |
| Author | Latorre, Omar |
| Author_xml | – sequence: 1 givenname: Omar orcidid: 0000-0001-5609-6310 surname: Latorre fullname: Latorre, Omar |
| BookMark | eNpVkdFKwzAUhoMoOOeewJu-wOpJTpqm4M0YUwcDQed1SNNkZnaNJBXUp7duQ_Tq_PzwfxfnuyCnXegsIVcUcloyIa-TbfOd7nMGDHJgOcgTMmKc0iktJZ7-yedkktIWAFgpOZU4InzxoU2f6a7JXm3sbOu_dO9Dl-l2E6LvX3YpcyFm8zYk22dPffTd5pKcOd0mOzneMXm-Xazn99PVw91yPltNDQMpp8YZKdAxrNGhRixNUVJobIW8orVwjllhRC2YcY0Ai40tJOXOCihQONngmCwP3CborXqLfqfjpwraq30R4kbp2HvTWuUcNgyZ0AUabpirkVKORSWqIdWcD6ybI8vrtrP9f9yxe-989GGrlU1q9rgeHkWLqgCEYY6HuYkhpWjd756C2mtQgwY1aFA_GhQwBRK_AbGwffs |
| ContentType | Journal Article |
| Copyright | LICENCIA DE USO: Los documentos a texto completo incluidos en Dialnet son de acceso libre y propiedad de sus autores y/o editores. Por tanto, cualquier acto de reproducción, distribución, comunicación pública y/o transformación total o parcial requiere el consentimiento expreso y escrito de aquéllos. Cualquier enlace al texto completo de estos documentos deberá hacerse a través de la URL oficial de éstos en Dialnet. Más información: https://dialnet.unirioja.es/info/derechosOAI | INTELLECTUAL PROPERTY RIGHTS STATEMENT: Full text documents hosted by Dialnet are protected by copyright and/or related rights. This digital object is accessible without charge, but its use is subject to the licensing conditions set by its authors or editors. Unless expressly stated otherwise in the licensing conditions, you are free to linking, browsing, printing and making a copy for your own personal purposes. All other acts of reproduction and communication to the public are subject to the licensing conditions expressed by editors and authors and require consent from them. Any link to this document should be made using its official URL in Dialnet. More info: https://dialnet.unirioja.es/info/derechosOAI |
| Copyright_xml | – notice: LICENCIA DE USO: Los documentos a texto completo incluidos en Dialnet son de acceso libre y propiedad de sus autores y/o editores. Por tanto, cualquier acto de reproducción, distribución, comunicación pública y/o transformación total o parcial requiere el consentimiento expreso y escrito de aquéllos. Cualquier enlace al texto completo de estos documentos deberá hacerse a través de la URL oficial de éstos en Dialnet. Más información: https://dialnet.unirioja.es/info/derechosOAI | INTELLECTUAL PROPERTY RIGHTS STATEMENT: Full text documents hosted by Dialnet are protected by copyright and/or related rights. This digital object is accessible without charge, but its use is subject to the licensing conditions set by its authors or editors. Unless expressly stated otherwise in the licensing conditions, you are free to linking, browsing, printing and making a copy for your own personal purposes. All other acts of reproduction and communication to the public are subject to the licensing conditions expressed by editors and authors and require consent from them. Any link to this document should be made using its official URL in Dialnet. More info: https://dialnet.unirioja.es/info/derechosOAI |
| DBID | AAYXX CITATION AGMXS FKZ DOA |
| DOI | 10.17268/sel.mat.2020.02.08 |
| DatabaseName | CrossRef Dialnet (Open Access Full Text) Dialnet DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: Acceso a contenido Full Text - Doaj url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 2411-1783 |
| EndPage | 266 |
| ExternalDocumentID | oai_doaj_org_article_ff3d2326a53c4c2fb311435969b31b44 oai_dialnet_unirioja_es_ART0001595030 10_17268_sel_mat_2020_02_08 |
| GroupedDBID | AAYXX ADBBV ALMA_UNASSIGNED_HOLDINGS BCNDV CITATION GROUPED_DOAJ OK1 AGMXS FKZ |
| ID | FETCH-LOGICAL-c2088-cfc863f23b3f3a337c5710de93491b6ff2e6c6b62cfd60e3de5814fe60536f8d3 |
| IEDL.DBID | DOA |
| ISSN | 2411-1783 |
| IngestDate | Fri Oct 03 12:44:02 EDT 2025 Thu Jul 20 13:41:50 EDT 2023 Sat Nov 29 03:40:51 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2088-cfc863f23b3f3a337c5710de93491b6ff2e6c6b62cfd60e3de5814fe60536f8d3 |
| ORCID | 0000-0001-5609-6310 |
| OpenAccessLink | https://doaj.org/article/ff3d2326a53c4c2fb311435969b31b44 |
| PageCount | 10 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_ff3d2326a53c4c2fb311435969b31b44 dialnet_primary_oai_dialnet_unirioja_es_ART0001595030 crossref_primary_10_17268_sel_mat_2020_02_08 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-12-30 |
| PublicationDateYYYYMMDD | 2020-12-30 |
| PublicationDate_xml | – month: 12 year: 2020 text: 2020-12-30 day: 30 |
| PublicationDecade | 2020 |
| PublicationTitle | Selecciones matemáticas : revista científica del Departamento Académico de Matemáticas |
| PublicationYear | 2020 |
| Publisher | Universidad Nacional de Trujillo |
| Publisher_xml | – name: Universidad Nacional de Trujillo |
| SSID | ssj0002784183 |
| Score | 2.1290805 |
| Snippet | In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a... |
| SourceID | doaj dialnet crossref |
| SourceType | Open Website Index Database |
| StartPage | 257 |
| SubjectTerms | Algoritmo de parámetro fijo Algoritmo exacto Closest String Problem Combinatorial Optimization Exact Algorithm Fixed Parameter Algorithm Kernelización Kernelization Optimización combinatoria Problema de la subsecuencia de caracteres más próxima |
| Title | Exact and kernelization algorithms for Closet String |
| URI | https://dialnet.unirioja.es/servlet/oaiart?codigo=8915755 https://doaj.org/article/ff3d2326a53c4c2fb311435969b31b44 |
| Volume | 7 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: Acceso a contenido Full Text - Doaj customDbUrl: eissn: 2411-1783 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002784183 issn: 2411-1783 databaseCode: DOA dateStart: 20140101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT4QwEG3MRhMvRqPG9SscPIrSFko5qnHjyZioibeGTqe668qahTX-fKcsa3ZPXryRBgh9A8x7hXnD2FnugZeQpLHgZRanFjHW2idx6MXoXW6tE65tNpHf3-uXl-JhqdVX-Cdsbg88B-7Se-ko66syk5CC8FbykOILVdCWTVsn0CQvlsTUaPE5rfXgpAzFY55r2VkO5ULpyxrHF0QISR6KpLXs1CtpaSPUbFTYrPj4twlnsM22OqYYXc2vcIetYb3L0tvvEpqI5H_0jtMKx10ZZVSOXyek898-6ohoaHQzntTYRI9NWLbbY8-D26ebu7hrfBCDoKc-Bg9aSS-klV6WUuaQERFwWMi04FZ5L1CBskqAdypB6TDTPPVI0kQqr53cZ71qUuEBizTpX02UTWJB8IG1mgMXoBAycBx8n50v5m0-5_4WJuiCAJMhmAzBZAJMJhEm0X2Wddj87h38qRdjs2o4HU5GpcHaEB9vC7WLjN4jfXYdkFw9KAxQqE0XavNXqA__4yRHbDNMp_VqTI5Zr5nO8IStw1czrKen7V30Ay4Fyn8 |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Exact+and+kernelization+algorithms+for+Closet+String&rft.jtitle=Selecciones+matem%C3%A1ticas+%3A+revista+cient%C3%ADfica+del+Departamento+Acad%C3%A9mico+de+Matem%C3%A1ticas&rft.au=Latorre+Vilca%2C+Omar&rft.date=2020-12-30&rft.issn=2411-1783&rft.eissn=2411-1783&rft.volume=7&rft.issue=2&rft.spage=257&rft.epage=266&rft_id=info:doi/10.17268%2Fsel.mat.2020.02.08&rft.externalDocID=oai_dialnet_unirioja_es_ART0001595030 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2411-1783&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2411-1783&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2411-1783&client=summon |