A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol
In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security,...
Gespeichert in:
| Veröffentlicht in: | PloS one 2017-04, Vol.12 (4), p.e0175500-e0175500 |
|---|---|
| Hauptverfasser: | , , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | e0175500 |
|---|---|
| container_issue | 4 |
| container_start_page | e0175500 |
| container_title | PloS one |
| container_volume | 12 |
| creator | Zeng, Ping Tan, Qingping Meng, Xiankai Shao, Zeming Xie, Qinzheng Yan, Ying Cao, Wei Xu, Jianjun |
| description | In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications. |
| doi_str_mv | 10.1371/journal.pone.0175500 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_1886663807</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A489137133</galeid><doaj_id>oai_doaj_org_article_064fe9afec7d446a8479c589d1e80948</doaj_id><sourcerecordid>A489137133</sourcerecordid><originalsourceid>FETCH-LOGICAL-c692t-6d93c8c00630cccee53b5f9a7cbcf08b1583d9fe7e4194dd5510c27e338ac3893</originalsourceid><addsrcrecordid>eNqNklGP1CAUhRujcdfVf2CUxMToQ0copYUXk8lG3UkmWTPO-koopS0TWkagxv33MjvdzdTsg-EBAt89cC4nSV4juEC4RJ92dnSDMIu9HdQCopIQCJ8k54jhLC0yiJ-erM-SF97vICSYFsXz5CyjmDFEyvNkswT9aIJO9yIE5QbQCd-llR6EuwXdbeV0DYRprdOh60FjHbjZrEEvguz00AI9gNApcLXdfgd7Z4OV1rxMnjXCePVqmi-Sm69ftpdX6fr62-pyuU5lwbKQFjXDkkoICwyllEoRXJGGiVJWsoG0QoTimjWqVDlieV0TgqDMSoUxFRJThi-St0fdvbGeT-3wHNHoscAUlpFYHYnaih3fO91HV9wKze82rGu5cEFLozgs8kYx0ShZ1nleCJqXTBLKaqQoZDmNWp-n28aqV7VUQ3DCzETnJ4PueGt_89hzmlMSBT5MAs7-GpUPvNdeKmPEoOx49-4SkqxAB2fv_kEfdzdRrYgG9NDYeK88iPJlTtkhJBhHavEIFUetei1jdhod92cFH2cFkQnqT2jF6D1f_dj8P3v9c86-P2E7JUzovDVj0HbwczA_gtJZ751qHpqMID8w993gh-jzKfqx7M3pBz0U3Wcd_wWf2f1e</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1886663807</pqid></control><display><type>article</type><title>A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><source>Public Library of Science (PLoS)</source><creator>Zeng, Ping ; Tan, Qingping ; Meng, Xiankai ; Shao, Zeming ; Xie, Qinzheng ; Yan, Ying ; Cao, Wei ; Xu, Jianjun</creator><contributor>Pappalardo, Francesco</contributor><creatorcontrib>Zeng, Ping ; Tan, Qingping ; Meng, Xiankai ; Shao, Zeming ; Xie, Qinzheng ; Yan, Ying ; Cao, Wei ; Xu, Jianjun ; Pappalardo, Francesco</creatorcontrib><description>In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0175500</identifier><identifier>PMID: 28399157</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Analysis ; Biology and Life Sciences ; Computer and Information Sciences ; Data analysis ; Data processing ; Distributed processing ; Embedded systems ; Engineering and Technology ; HTTP ; International conferences ; Internet ; Laboratories ; Pattern matching ; Physical Sciences ; Programming Languages ; Research and Analysis Methods ; Search engines ; Security ; String matching ; URLs (Hypertext navigation)</subject><ispartof>PloS one, 2017-04, Vol.12 (4), p.e0175500-e0175500</ispartof><rights>COPYRIGHT 2017 Public Library of Science</rights><rights>2017 Zeng et al. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2017 Zeng et al 2017 Zeng et al</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c692t-6d93c8c00630cccee53b5f9a7cbcf08b1583d9fe7e4194dd5510c27e338ac3893</citedby><cites>FETCH-LOGICAL-c692t-6d93c8c00630cccee53b5f9a7cbcf08b1583d9fe7e4194dd5510c27e338ac3893</cites><orcidid>0000-0002-5644-8387</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC5388485/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC5388485/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,860,881,2096,2915,23845,27901,27902,53766,53768,79343,79344</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/28399157$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Pappalardo, Francesco</contributor><creatorcontrib>Zeng, Ping</creatorcontrib><creatorcontrib>Tan, Qingping</creatorcontrib><creatorcontrib>Meng, Xiankai</creatorcontrib><creatorcontrib>Shao, Zeming</creatorcontrib><creatorcontrib>Xie, Qinzheng</creatorcontrib><creatorcontrib>Yan, Ying</creatorcontrib><creatorcontrib>Cao, Wei</creatorcontrib><creatorcontrib>Xu, Jianjun</creatorcontrib><title>A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Biology and Life Sciences</subject><subject>Computer and Information Sciences</subject><subject>Data analysis</subject><subject>Data processing</subject><subject>Distributed processing</subject><subject>Embedded systems</subject><subject>Engineering and Technology</subject><subject>HTTP</subject><subject>International conferences</subject><subject>Internet</subject><subject>Laboratories</subject><subject>Pattern matching</subject><subject>Physical Sciences</subject><subject>Programming Languages</subject><subject>Research and Analysis Methods</subject><subject>Search engines</subject><subject>Security</subject><subject>String matching</subject><subject>URLs (Hypertext navigation)</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>BENPR</sourceid><sourceid>DOA</sourceid><recordid>eNqNklGP1CAUhRujcdfVf2CUxMToQ0copYUXk8lG3UkmWTPO-koopS0TWkagxv33MjvdzdTsg-EBAt89cC4nSV4juEC4RJ92dnSDMIu9HdQCopIQCJ8k54jhLC0yiJ-erM-SF97vICSYFsXz5CyjmDFEyvNkswT9aIJO9yIE5QbQCd-llR6EuwXdbeV0DYRprdOh60FjHbjZrEEvguz00AI9gNApcLXdfgd7Z4OV1rxMnjXCePVqmi-Sm69ftpdX6fr62-pyuU5lwbKQFjXDkkoICwyllEoRXJGGiVJWsoG0QoTimjWqVDlieV0TgqDMSoUxFRJThi-St0fdvbGeT-3wHNHoscAUlpFYHYnaih3fO91HV9wKze82rGu5cEFLozgs8kYx0ShZ1nleCJqXTBLKaqQoZDmNWp-n28aqV7VUQ3DCzETnJ4PueGt_89hzmlMSBT5MAs7-GpUPvNdeKmPEoOx49-4SkqxAB2fv_kEfdzdRrYgG9NDYeK88iPJlTtkhJBhHavEIFUetei1jdhod92cFH2cFkQnqT2jF6D1f_dj8P3v9c86-P2E7JUzovDVj0HbwczA_gtJZ751qHpqMID8w993gh-jzKfqx7M3pBz0U3Wcd_wWf2f1e</recordid><startdate>20170411</startdate><enddate>20170411</enddate><creator>Zeng, Ping</creator><creator>Tan, Qingping</creator><creator>Meng, Xiankai</creator><creator>Shao, Zeming</creator><creator>Xie, Qinzheng</creator><creator>Yan, Ying</creator><creator>Cao, Wei</creator><creator>Xu, Jianjun</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-5644-8387</orcidid></search><sort><creationdate>20170411</creationdate><title>A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol</title><author>Zeng, Ping ; Tan, Qingping ; Meng, Xiankai ; Shao, Zeming ; Xie, Qinzheng ; Yan, Ying ; Cao, Wei ; Xu, Jianjun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c692t-6d93c8c00630cccee53b5f9a7cbcf08b1583d9fe7e4194dd5510c27e338ac3893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Biology and Life Sciences</topic><topic>Computer and Information Sciences</topic><topic>Data analysis</topic><topic>Data processing</topic><topic>Distributed processing</topic><topic>Embedded systems</topic><topic>Engineering and Technology</topic><topic>HTTP</topic><topic>International conferences</topic><topic>Internet</topic><topic>Laboratories</topic><topic>Pattern matching</topic><topic>Physical Sciences</topic><topic>Programming Languages</topic><topic>Research and Analysis Methods</topic><topic>Search engines</topic><topic>Security</topic><topic>String matching</topic><topic>URLs (Hypertext navigation)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zeng, Ping</creatorcontrib><creatorcontrib>Tan, Qingping</creatorcontrib><creatorcontrib>Meng, Xiankai</creatorcontrib><creatorcontrib>Shao, Zeming</creatorcontrib><creatorcontrib>Xie, Qinzheng</creatorcontrib><creatorcontrib>Yan, Ying</creatorcontrib><creatorcontrib>Cao, Wei</creatorcontrib><creatorcontrib>Xu, Jianjun</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing & Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological & Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing & Allied Health Database (Alumni Edition)</collection><collection>Meteorological & Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing & Allied Health Premium</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zeng, Ping</au><au>Tan, Qingping</au><au>Meng, Xiankai</au><au>Shao, Zeming</au><au>Xie, Qinzheng</au><au>Yan, Ying</au><au>Cao, Wei</au><au>Xu, Jianjun</au><au>Pappalardo, Francesco</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2017-04-11</date><risdate>2017</risdate><volume>12</volume><issue>4</issue><spage>e0175500</spage><epage>e0175500</epage><pages>e0175500-e0175500</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>28399157</pmid><doi>10.1371/journal.pone.0175500</doi><orcidid>https://orcid.org/0000-0002-5644-8387</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1932-6203 |
| ispartof | PloS one, 2017-04, Vol.12 (4), p.e0175500-e0175500 |
| issn | 1932-6203 1932-6203 |
| language | eng |
| recordid | cdi_plos_journals_1886663807 |
| source | MEDLINE; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; PubMed Central; Free Full-Text Journals in Chemistry; Public Library of Science (PLoS) |
| subjects | Algorithms Analysis Biology and Life Sciences Computer and Information Sciences Data analysis Data processing Distributed processing Embedded systems Engineering and Technology HTTP International conferences Internet Laboratories Pattern matching Physical Sciences Programming Languages Research and Analysis Methods Search engines Security String matching URLs (Hypertext navigation) |
| title | A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T12%3A34%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20multi-pattern%20hash-binary%20hybrid%20algorithm%20for%20URL%20matching%20in%20the%20HTTP%20protocol&rft.jtitle=PloS%20one&rft.au=Zeng,%20Ping&rft.date=2017-04-11&rft.volume=12&rft.issue=4&rft.spage=e0175500&rft.epage=e0175500&rft.pages=e0175500-e0175500&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0175500&rft_dat=%3Cgale_plos_%3EA489137133%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1886663807&rft_id=info:pmid/28399157&rft_galeid=A489137133&rft_doaj_id=oai_doaj_org_article_064fe9afec7d446a8479c589d1e80948&rfr_iscdi=true |