{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:06:50Z","timestamp":1762376810522,"version":"3.37.3"},"reference-count":10,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:00:00Z","timestamp":1606262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"ICT Division"},{"name":"Government of the Peoples\u2019 Republic of Bangladesh"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,16]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>Researchers and practitioners use a number of popular sequence comparison tools that use many alignment-based techniques. Due to high time and space complexity and length-related restrictions, researchers often seek alignment-free tools. Recently, some interesting ideas, namely, Minimal Absent Words (MAW) and Relative Absent Words (RAW), have received much interest among the scientific community as distance measures that can give us alignment-free alternatives. This drives us to structure a framework for analysing biological sequences in an alignment-free manner.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>In this application note, we present Alignment-free Dissimilarity Analysis &amp; Comparison Tool (ADACT), a simple web-based tool that computes the analogy among sequences using a varied number of indexes through the distance matrix, species relation list and phylogenetic tree. This tool basically combines absent word (MAW or RAW) computation, dissimilarity measures, species relationship and thus brings all required software in one platform for the ease of researchers and practitioners alike in the field of bioinformatics. We have also developed a restful API.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>ADACT has been hosted at http:\/\/research.buet.ac.bd\/ADACT\/.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btaa853","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T11:19:17Z","timestamp":1600687157000},"page":"1468-1470","source":"Crossref","is-referenced-by-count":5,"title":["ADACT: a tool for analysing (dis)similarity among nucleotide and protein sequences using minimal and relative absent words"],"prefix":"10.1093","volume":"37","author":[{"given":"Mujtahid","family":"Akon","sequence":"first","affiliation":[{"name":"Department of CSE, BUET , Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7946-1744","authenticated-orcid":false,"given":"Muntashir","family":"Akon","sequence":"additional","affiliation":[{"name":"Department of CSE, RUET , Rajshahi, Bangladesh"}]},{"given":"Mohimenul","family":"Kabir","sequence":"additional","affiliation":[{"name":"Department of CSE, BUET , Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9887-4456","authenticated-orcid":false,"given":"M Saifur","family":"Rahman","sequence":"additional","affiliation":[{"name":"Department of CSE, BUET , Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9419-6478","authenticated-orcid":false,"given":"M Sohel","family":"Rahman","sequence":"additional","affiliation":[{"name":"Department of CSE, BUET , Dhaka, Bangladesh"}]}],"member":"286","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"2023051709350089000_btaa853-B1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","article-title":"Using minimal absent words to build phylogeny","volume":"450","author":"Chairungsee","year":"2012","journal-title":"Theor. Comput. Sci"},{"key":"2023051709350089000_btaa853-B2","doi-asserted-by":"crossref","first-page":"3113","DOI":"10.1093\/bioinformatics\/btm506","article-title":"On the hierarchical classification of G protein-coupled receptors","volume":"23","author":"Davies","year":"2007","journal-title":"Bioinformatics"},{"key":"2023051709350089000_btaa853-B3","doi-asserted-by":"crossref","first-page":"e29344","DOI":"10.1371\/journal.pone.0029344","article-title":"Minimal absent words in four human genome assemblies","volume":"6","author":"Garcia","year":"2011","journal-title":"PLoS One"},{"key":"2023051709350089000_btaa853-B4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1038\/nmeth.1923","article-title":"Fast gapped-read alignment with Bowtie 2","volume":"9","author":"Langmead","year":"2012","journal-title":"Nat. Methods"},{"key":"2023051709350089000_btaa853-B5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1186\/s13104-016-1972-z","article-title":"Absent words and the (dis) similarity analysis of DNA sequences: an experimental study","volume":"9","author":"Rahman","year":"2016","journal-title":"BMC Res. Notes"},{"key":"2023051709350089000_btaa853-B6","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol"},{"key":"2023051709350089000_btaa853-B7","doi-asserted-by":"crossref","first-page":"2421","DOI":"10.1093\/bioinformatics\/btv189","article-title":"Three minimal sequences found in Ebola virus genomes and absent from human DNA","volume":"31","author":"Silva","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051709350089000_btaa853-B8","doi-asserted-by":"crossref","DOI":"10.1201\/9781420070347","volume-title":"Algorithms in Bioinformatics: A Practical Introduction. Chapman & Hall\/CRC Mathematical and Computational Biology","author":"Sung","year":"2009"},{"key":"2023051709350089000_btaa853-B9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1089\/cmb.2011.0052","article-title":"Large local analysis of the unaligned genome and its application","volume":"20","author":"Yang","year":"2013","journal-title":"J. Comput. Biol"},{"key":"2023051709350089000_btaa853-B10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1186\/s13059-019-1755-7","article-title":"Benchmarking of alignment-free sequence comparison methods","volume":"20","author":"Zielezinski","year":"2019","journal-title":"Genome Biol"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btaa853\/34542390\/btaa853.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/37\/10\/1468\/50361094\/btaa853.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/37\/10\/1468\/50361094\/btaa853.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T09:50:24Z","timestamp":1684317024000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/37\/10\/1468\/5918021"}},"subtitle":[],"editor":[{"given":"Cowen","family":"Lenore","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,11,25]]},"references-count":10,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,6,16]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btaa853","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"type":"print","value":"1367-4803"},{"type":"electronic","value":"1367-4811"}],"subject":[],"published-other":{"date-parts":[[2021,5,15]]},"published":{"date-parts":[[2020,11,25]]}}}