[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_a3b0c722-fc8f-481d-8eac-3a087161dc71":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:a3b0c722-fc8f-481d-8eac-3a087161dc71,\"}":892},{"meta":4,"data":6},{"total":5},"117",[7,56,246,295,379,474,535,646,710,744],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":25,"verifyStatus":26,"verifyTime":27,"verifyNote":28,"languages":29,"translateLanguages":28,"viewCount":32,"subjectFields":33,"manageAffiliations":34,"indexDatabases":35,"url":36,"thumbnailPath":28,"statistic":28,"gsStatistic":37,"type":55,"analyzePriority":28},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":14,"issn":16,"title":18,"introduce":21,"gsId":23},{"VOID":15},"VN",{"VOID":17},"08667535",{"EN":19,"VI":20},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":22},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":24},"MS2_GJQAAAAJ","PUBLISHER","VERIFIED","2025-10-27T06:27:25.058+00:00",null,[30,31],"VI","EN",0,[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":38,"totalPublicationByYear":39,"totalCitation":43,"totalCitationByYear":44,"totalCitationPerPublication":52,"totalCitationPerPublicationByYear":53,"hindexLast5Year":42,"hindex":42},483,{"0":40,"2020":40,"2021":40,"2022":40,"2024":40,"2025":41,"2026":42},1,475,3,117,{"2017":40,"2018":40,"2019":45,"2020":46,"2021":46,"2022":47,"2023":48,"2024":49,"2025":50,"2026":51},4,5,11,6,7,53,15,0.24,{"2020":46,"2021":46,"2022":47,"2024":49,"2025":54,"2026":46},0.11,"JOURNAL",{"id":57,"createTime":58,"updateTime":10,"relativeEntities":59,"slug":60,"properties":61,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":70,"manageAffiliations":71,"indexDatabases":84,"url":101,"thumbnailPath":28,"statistic":102,"gsStatistic":195,"type":55,"analyzePriority":28},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":62,"issn":63,"title":65,"gsId":67},{"VOID":15},{"VOID":64},"08667136",{"EN":66},"Vietnam Journal of Mechanics",{"VOID":68},"B98qpzgAAAAJ",29,[],[72],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":74,"slug":28,"properties":75,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":83,"statistic":28},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":76,"country":79,"abbreviation":80},{"EN":77,"VI":78},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":15},{"VOID":81},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[85],{"id":86,"indexDatabase":87,"url":97,"indexYears":98,"academicFieldIds":99,"indexDatabaseRanking":28},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":89,"label":90,"description":92,"key":94,"publicationTags":95,"standard":28},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":91,"VI":91},"ACI - Asean Citation Index",{"EN":93,"VI":93},"Cơ sở dữ liệu ACI","aci",[96],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[100],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":32,"impactFactorByYear":103,"i10Index":122,"i10IndexLast5Year":123,"totalPublication":124,"totalPublicationByYear":125,"totalCitation":143,"totalCitationByYear":144,"totalCitationPerPublication":163,"totalCitationPerPublicationByYear":164,"hindexLast5Year":146,"hindex":146},{"1994":104,"1995":105,"1997":54,"1998":106,"1999":105,"2000":107,"2001":108,"2002":107,"2003":107,"2004":109,"2005":110,"2006":111,"2007":105,"2008":110,"2010":112,"2011":113,"2012":114,"2013":115,"2014":105,"2015":116,"2016":111,"2017":116,"2018":117,"2019":109,"2020":118,"2021":119,"2022":115,"2023":120,"2024":121},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":126,"1980":127,"1981":128,"1982":129,"1983":51,"1984":129,"1985":130,"1986":128,"1987":51,"1988":51,"1989":122,"1990":128,"1991":129,"1992":128,"1993":131,"1994":132,"1995":133,"1996":133,"1997":132,"1998":131,"1999":128,"2000":122,"2001":134,"2002":130,"2003":135,"2004":122,"2005":136,"2006":133,"2007":137,"2008":138,"2009":131,"2010":134,"2011":47,"2012":139,"2013":131,"2014":134,"2015":131,"2016":135,"2017":140,"2018":132,"2019":131,"2020":141,"2021":122,"2022":142,"2023":130,"2024":123},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":40,"1982":40,"1983":40,"1991":132,"1992":45,"1993":48,"1994":49,"1995":145,"1996":146,"1997":134,"1998":140,"1999":47,"2000":136,"2001":127,"2002":128,"2003":147,"2004":148,"2005":131,"2006":149,"2007":150,"2008":151,"2009":152,"2010":153,"2011":154,"2012":155,"2013":156,"2014":152,"2015":157,"2016":158,"2017":138,"2018":159,"2019":160,"2020":159,"2021":161,"2022":162,"2023":45},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":165,"1982":106,"1983":112,"1991":166,"1992":167,"1993":52,"1994":168,"1995":169,"1996":170,"1997":171,"1998":172,"1999":119,"2000":172,"2001":173,"2002":174,"2003":175,"2004":176,"2005":172,"2006":177,"2007":178,"2008":179,"2009":180,"2010":181,"2011":182,"2012":183,"2013":184,"2014":185,"2015":186,"2016":187,"2017":188,"2018":189,"2019":190,"2020":191,"2021":192,"2022":193,"2023":194},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":28,"impactFactorByYear":28,"i10Index":196,"i10IndexLast5Year":128,"totalPublication":197,"totalPublicationByYear":198,"totalCitation":203,"totalCitationByYear":204,"totalCitationPerPublication":219,"totalCitationPerPublicationByYear":220,"hindexLast5Year":126,"hindex":199},42,1244,{"0":147,"1979":146,"1980":127,"1981":127,"1982":199,"1983":199,"1984":129,"1985":129,"1986":128,"1987":129,"1988":51,"1989":140,"1990":127,"1991":129,"1992":129,"1993":133,"1994":147,"1995":132,"1996":69,"1997":132,"1998":131,"1999":134,"2000":140,"2001":131,"2002":134,"2003":131,"2004":133,"2005":132,"2006":131,"2007":200,"2008":138,"2009":140,"2010":132,"2011":122,"2012":201,"2013":132,"2014":140,"2015":148,"2016":122,"2017":202,"2018":69,"2019":140,"2020":69,"2021":132,"2022":139,"2023":130,"2024":133,"2025":131,"2026":138},16,47,41,32,2194,{"1997":126,"1998":205,"1999":126,"2000":145,"2001":145,"2002":126,"2003":205,"2004":127,"2005":129,"2006":146,"2007":132,"2008":136,"2009":47,"2010":131,"2011":138,"2012":206,"2013":207,"2014":208,"2015":162,"2016":209,"2017":209,"2018":210,"2019":211,"2020":212,"2021":213,"2022":214,"2023":215,"2024":216,"2025":217,"2026":218},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":221,"1998":222,"1999":223,"2000":224,"2001":118,"2002":223,"2003":222,"2004":225,"2005":226,"2006":115,"2007":227,"2008":228,"2009":229,"2010":230,"2011":231,"2012":232,"2013":233,"2014":234,"2015":235,"2016":236,"2017":237,"2018":238,"2019":239,"2020":240,"2021":48,"2022":241,"2023":242,"2024":243,"2025":244,"2026":245},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":247,"createTime":248,"updateTime":10,"relativeEntities":249,"slug":250,"properties":251,"entityType":25,"verifyStatus":26,"verifyTime":261,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":147,"subjectFields":262,"manageAffiliations":263,"indexDatabases":264,"url":273,"thumbnailPath":28,"statistic":274,"gsStatistic":290,"type":55,"analyzePriority":28},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":252,"eissn":253,"issn":255,"title":257,"gsId":259},{"VOID":15},{"VOID":254},"25881132",{"VOID":256},"26159309",{"EN":258},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":260},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[265],{"id":266,"indexDatabase":267,"url":272,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":268,"label":269,"description":270,"key":94,"publicationTags":271,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":32,"impactFactorByYear":275,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":276,"totalPublicationByYear":277,"totalCitation":282,"totalCitationByYear":283,"totalCitationPerPublication":284,"totalCitationPerPublicationByYear":285,"hindexLast5Year":45,"hindex":45},{"2019":106,"2020":110,"2021":104,"2022":104,"2023":109,"2024":108},360,{"2016":140,"2017":278,"2018":69,"2019":148,"2020":279,"2021":200,"2022":280,"2023":281,"2024":200},34,48,49,50,163,{"2016":145,"2017":145,"2018":135,"2019":140,"2020":50,"2021":135,"2022":128,"2023":48},0.45,{"2016":224,"2017":117,"2018":286,"2019":287,"2020":288,"2021":284,"2022":289,"2023":104},0.72,0.87,1.1,0.37,{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":136,"totalPublicationByYear":291,"totalCitation":127,"totalCitationByYear":292,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":294,"hindexLast5Year":123,"hindex":42},{"0":123,"2014":40,"2015":40,"2016":130},{"2016":40,"2019":123,"2021":123,"2023":45,"2024":42,"2025":40,"2026":40},0.71,{"2016":106},{"id":296,"createTime":297,"updateTime":10,"relativeEntities":298,"slug":299,"properties":300,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":51,"subjectFields":310,"manageAffiliations":311,"indexDatabases":312,"url":313,"thumbnailPath":28,"statistic":314,"gsStatistic":349,"type":55,"analyzePriority":28},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":301,"eissn":302,"issn":304,"title":306,"gsId":308},{"VOID":15},{"VOID":303},"28155947",{"VOID":305},"08863166",{"EN":307},"Communications in Physics",{"VOID":309},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":32,"impactFactorByYear":315,"i10Index":199,"i10IndexLast5Year":45,"totalPublication":321,"totalPublicationByYear":322,"totalCitation":326,"totalCitationByYear":327,"totalCitationPerPublication":335,"totalCitationPerPublicationByYear":336,"hindexLast5Year":126,"hindex":126},{"2008":110,"2009":316,"2010":165,"2011":317,"2012":317,"2013":112,"2014":318,"2015":105,"2016":108,"2017":116,"2018":318,"2019":52,"2020":319,"2021":284,"2022":320,"2023":116,"2024":222},0.3,0.03,0.16,0.34,0.28,738,{"2007":323,"2008":145,"2009":145,"2010":136,"2011":139,"2012":324,"2013":138,"2014":151,"2015":69,"2016":151,"2017":325,"2018":142,"2019":50,"2020":201,"2021":141,"2022":152,"2023":150,"2024":278,"2025":123},14,107,56,947,{"2007":148,"2008":49,"2009":49,"2010":127,"2011":328,"2012":155,"2013":278,"2014":329,"2015":206,"2016":330,"2017":331,"2018":332,"2019":333,"2020":334,"2021":127,"2022":132,"2023":148},52,94,86,129,76,91,106,1.28,{"2007":337,"2008":338,"2009":338,"2010":293,"2011":339,"2012":340,"2013":341,"2014":342,"2015":179,"2016":232,"2017":343,"2018":344,"2019":180,"2020":345,"2021":346,"2022":347,"2023":348},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":28,"impactFactorByYear":28,"i10Index":133,"i10IndexLast5Year":145,"totalPublication":350,"totalPublicationByYear":351,"totalCitation":355,"totalCitationByYear":356,"totalCitationPerPublication":363,"totalCitationPerPublicationByYear":364,"hindexLast5Year":145,"hindex":323},1117,{"0":48,"1972":40,"1991":127,"1992":51,"1993":49,"1994":47,"1995":323,"1996":42,"1997":40,"1998":146,"1999":146,"2000":205,"2001":47,"2002":128,"2003":136,"2004":132,"2005":136,"2006":148,"2007":141,"2008":149,"2009":352,"2010":353,"2011":196,"2012":208,"2013":280,"2014":354,"2015":150,"2016":328,"2017":137,"2018":142,"2019":325,"2020":152,"2021":139,"2022":139,"2023":142,"2024":148,"2025":147,"2026":132},33,44,92,1611,{"2004":46,"2005":357,"2006":47,"2007":47,"2008":126,"2009":140,"2010":69,"2011":147,"2012":147,"2013":147,"2014":208,"2015":353,"2016":201,"2017":280,"2018":161,"2019":358,"2020":212,"2021":331,"2022":212,"2023":359,"2024":360,"2025":361,"2026":362},8,85,153,178,188,132,1.44,{"2004":365,"2005":169,"2006":289,"2007":320,"2008":117,"2009":171,"2010":366,"2011":367,"2012":368,"2013":225,"2014":369,"2015":288,"2016":171,"2017":370,"2018":371,"2019":231,"2020":372,"2021":373,"2022":374,"2023":375,"2024":376,"2025":377,"2026":378},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":394,"translateLanguages":28,"viewCount":127,"subjectFields":395,"manageAffiliations":396,"indexDatabases":404,"url":418,"thumbnailPath":28,"statistic":419,"gsStatistic":446,"type":55,"analyzePriority":28},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":386,"issn":387,"title":389,"gsId":392},{"VOID":15},{"VOID":388},"18139663",{"EN":390,"VI":391},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":393},"hVh9fuMAAAAJ",[30,31],[],[397],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":398,"slug":28,"properties":399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":403,"statistic":28},[],{"title":400,"country":401,"abbreviation":402},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[405],{"id":406,"indexDatabase":407,"url":412,"indexYears":413,"academicFieldIds":414,"indexDatabaseRanking":28},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":408,"label":409,"description":410,"key":94,"publicationTags":411,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[100,415,416,417],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":32,"impactFactorByYear":420,"i10Index":129,"i10IndexLast5Year":42,"totalPublication":425,"totalPublicationByYear":426,"totalCitation":431,"totalCitationByYear":432,"totalCitationPerPublication":438,"totalCitationPerPublicationByYear":439,"hindexLast5Year":323,"hindex":323},{"2013":107,"2014":107,"2015":111,"2016":365,"2017":107,"2018":421,"2019":117,"2020":422,"2021":227,"2022":423,"2023":368,"2024":424},0.04,0.32,0.39,0.57,1184,{"2012":427,"2013":358,"2014":278,"2015":428,"2016":429,"2017":51,"2018":430,"2019":148,"2020":130,"2021":136,"2022":199,"2023":132,"2024":42},473,71,251,134,995,{"2012":433,"2013":434,"2014":434,"2015":333,"2016":435,"2017":436,"2018":437,"2019":211,"2020":281,"2021":434,"2022":126,"2023":152},149,45,114,51,232,0.84,{"2012":422,"2013":440,"2014":232,"2015":335,"2016":284,"2017":441,"2018":442,"2019":443,"2020":189,"2021":444,"2022":348,"2023":445},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":28,"impactFactorByYear":28,"i10Index":150,"i10IndexLast5Year":132,"totalPublication":447,"totalPublicationByYear":448,"totalCitation":449,"totalCitationByYear":450,"totalCitationPerPublication":192,"totalCitationPerPublicationByYear":460,"hindexLast5Year":51,"hindex":199},1105,{"0":47,"1981":40,"1985":199,"1986":135,"1987":136,"1988":323,"1989":126,"1990":199,"1991":127,"1992":126,"1993":47,"1994":129,"1995":130,"1996":132,"1997":142,"1998":148,"1999":201,"2000":196,"2001":353,"2002":353,"2003":352,"2004":132,"2005":131,"2006":148,"2007":147,"2008":133,"2009":131,"2010":139,"2011":201,"2012":281,"2013":142,"2014":202,"2015":69,"2016":140,"2017":136,"2018":140,"2019":134,"2020":134,"2021":133,"2022":134,"2023":134,"2024":136,"2025":49},3272,{"2007":145,"2008":323,"2009":46,"2010":48,"2011":129,"2012":148,"2013":140,"2014":69,"2015":152,"2016":160,"2017":162,"2018":451,"2019":452,"2020":453,"2021":454,"2022":455,"2023":456,"2024":457,"2025":458,"2026":459},109,173,236,318,398,469,442,440,297,{"2007":461,"2008":115,"2009":194,"2010":318,"2011":462,"2012":227,"2013":286,"2014":463,"2015":175,"2016":464,"2017":465,"2018":466,"2019":467,"2020":468,"2021":469,"2022":470,"2023":471,"2024":472,"2025":473},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":475,"createTime":476,"updateTime":382,"relativeEntities":477,"slug":478,"properties":479,"entityType":25,"verifyStatus":26,"verifyTime":491,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":202,"subjectFields":492,"manageAffiliations":493,"indexDatabases":509,"url":510,"thumbnailPath":28,"statistic":511,"gsStatistic":525,"type":55,"analyzePriority":28},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":480,"issn":481,"title":483,"introduce":486,"gsId":489},{"VOID":15},{"VOID":482},"23541210",{"EN":484,"VI":485},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":487,"VI":488},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"VOID":490},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[494],{"id":495,"createTime":28,"updateTime":28,"relativeEntities":496,"slug":28,"properties":497,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":507,"parentIds":508,"statistic":28},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":498,"address":501,"country":504,"abbreviation":505},{"EN":499,"VI":500},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":502,"VI":503},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam",{"VOID":15},{"VOID":506},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":32,"impactFactorByYear":512,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":520,"totalCitationByYear":521,"totalCitationPerPublication":108,"totalCitationPerPublicationByYear":523,"hindexLast5Year":45,"hindex":45},{"2022":513,"2023":111,"2024":106},0.01,1556,{"2020":47,"2021":516,"2022":517,"2023":518,"2024":519,"2025":122},57,306,801,358,161,{"2021":146,"2022":280,"2023":522},99,{"2021":524,"2022":318,"2023":104},0.23,{"impactFactor":28,"impactFactorByYear":28,"i10Index":123,"i10IndexLast5Year":123,"totalPublication":526,"totalPublicationByYear":527,"totalCitation":526,"totalCitationByYear":528,"totalCitationPerPublication":40,"totalCitationPerPublicationByYear":531,"hindexLast5Year":49,"hindex":49},476,{"0":205,"2019":123,"2021":139,"2022":459,"2023":451,"2024":357,"2025":49,"2026":48},{"2021":42,"2022":123,"2023":161,"2024":529,"2025":360,"2026":530},136,83,{"2021":105,"2022":513,"2023":532,"2024":127,"2025":533,"2026":534},0.62,25.43,13.83,{"id":536,"createTime":537,"updateTime":382,"relativeEntities":538,"slug":539,"properties":540,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":552,"translateLanguages":28,"viewCount":133,"subjectFields":553,"manageAffiliations":554,"indexDatabases":555,"url":556,"thumbnailPath":557,"statistic":558,"gsStatistic":594,"type":55,"analyzePriority":28},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":541,"issn":542,"title":544,"introduce":547,"gsId":550},{"VOID":15},{"VOID":543},"25252445",{"EN":545,"VI":546},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":548,"VI":549},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":551},"jyihv3YAAAAJ",[30,31],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":32,"impactFactorByYear":559,"i10Index":560,"i10IndexLast5Year":205,"totalPublication":561,"totalPublicationByYear":562,"totalCitation":568,"totalCitationByYear":569,"totalCitationPerPublication":579,"totalCitationPerPublicationByYear":580,"hindexLast5Year":140,"hindex":140},{"2007":317,"2010":112,"2011":109,"2012":421,"2013":165,"2014":421,"2015":421,"2016":111,"2017":116,"2018":104,"2019":109,"2020":320,"2021":284,"2022":168,"2023":116,"2024":108},67,1200,{"2002":51,"2003":51,"2004":47,"2005":352,"2006":142,"2007":131,"2008":147,"2009":139,"2010":278,"2011":138,"2012":69,"2013":206,"2014":137,"2015":69,"2016":196,"2017":563,"2018":209,"2019":564,"2020":565,"2021":566,"2022":530,"2023":567,"2024":428,"2025":281},130,78,90,80,61,3204,{"2002":42,"2003":123,"2004":123,"2005":570,"2006":47,"2007":127,"2008":571,"2009":572,"2010":196,"2011":573,"2012":130,"2013":560,"2014":574,"2015":149,"2016":325,"2017":575,"2018":576,"2019":577,"2020":578,"2021":453,"2022":206,"2023":205,"2025":51},189,223,765,246,98,171,377,355,199,2.67,{"2002":194,"2003":116,"2004":365,"2005":581,"2006":582,"2007":226,"2008":583,"2009":584,"2010":585,"2011":586,"2012":228,"2013":585,"2014":587,"2015":588,"2016":589,"2017":232,"2018":590,"2019":591,"2020":592,"2021":593,"2022":347,"2023":318,"2025":316},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":28,"impactFactorByYear":28,"i10Index":595,"i10IndexLast5Year":596,"totalPublication":597,"totalPublicationByYear":598,"totalCitation":609,"totalCitationByYear":610,"totalCitationPerPublication":625,"totalCitationPerPublicationByYear":626,"hindexLast5Year":142,"hindex":152},379,311,2120,{"0":361,"1960":40,"1971":40,"1975":40,"1987":40,"1988":40,"1989":40,"1990":45,"1992":40,"1993":40,"1994":46,"1995":46,"1996":45,"1997":42,"1998":49,"1999":42,"2000":123,"2001":42,"2002":48,"2003":46,"2004":145,"2005":131,"2006":51,"2007":131,"2008":135,"2009":146,"2010":127,"2011":122,"2012":148,"2013":352,"2014":201,"2015":149,"2016":599,"2017":600,"2018":601,"2019":209,"2020":602,"2021":603,"2022":604,"2023":605,"2024":606,"2025":607,"2026":608},77,75,97,143,167,156,182,231,230,128,13225,{"2003":149,"2004":150,"2005":201,"2006":196,"2007":157,"2008":436,"2009":328,"2010":611,"2011":612,"2012":333,"2013":522,"2014":613,"2015":520,"2016":614,"2017":615,"2018":616,"2019":617,"2020":618,"2021":619,"2022":620,"2023":621,"2024":622,"2025":623,"2026":624},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":627,"2004":628,"2005":629,"2006":630,"2007":186,"2008":631,"2009":45,"2010":632,"2011":633,"2012":634,"2013":42,"2014":635,"2015":636,"2016":192,"2017":637,"2018":638,"2019":628,"2020":639,"2021":640,"2022":641,"2023":642,"2024":643,"2025":644,"2026":645},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":647,"createTime":648,"updateTime":382,"relativeEntities":649,"slug":650,"properties":651,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":665,"translateLanguages":28,"viewCount":142,"subjectFields":666,"manageAffiliations":667,"indexDatabases":668,"url":677,"thumbnailPath":678,"statistic":679,"gsStatistic":699,"type":55,"analyzePriority":28},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":652,"eissn":653,"issn":655,"title":657,"introduce":660,"gsId":662},{"VOID":15},{"VOID":654},"25881140",{"VOID":656},"26159317",{"EN":658,"VI":659},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":661},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":663},"ZfBridMAAAAJ","Admin update database",[30,31],[],[],[669],{"id":670,"indexDatabase":671,"url":676,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":672,"label":673,"description":674,"key":94,"publicationTags":675,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":32,"impactFactorByYear":680,"i10Index":130,"i10IndexLast5Year":40,"totalPublication":682,"totalPublicationByYear":683,"totalCitation":685,"totalCitationByYear":686,"totalCitationPerPublication":691,"totalCitationPerPublicationByYear":692,"hindexLast5Year":47,"hindex":47},{"2000":317,"2005":513,"2007":107,"2010":513,"2011":317,"2012":106,"2013":107,"2014":317,"2015":107,"2016":107,"2017":421,"2018":317,"2019":421,"2020":113,"2021":582,"2022":681,"2023":194,"2024":104},0.19,1700,{"1985":131,"1986":353,"1987":130,"1988":69,"1989":69,"1990":200,"1991":196,"1992":146,"1993":279,"1994":148,"1995":200,"1996":201,"1999":278,"2000":140,"2001":128,"2002":202,"2003":353,"2004":138,"2005":202,"2006":136,"2007":278,"2008":139,"2009":137,"2010":141,"2011":278,"2012":132,"2013":202,"2014":202,"2015":278,"2016":684,"2017":359,"2018":160,"2019":162,"2020":281,"2021":157,"2022":436,"2023":358,"2024":136,"2025":135},165,870,{"1995":123,"1999":123,"2001":45,"2002":130,"2003":40,"2004":123,"2005":42,"2007":69,"2008":687,"2009":352,"2010":688,"2011":137,"2012":127,"2013":47,"2014":46,"2015":146,"2016":331,"2017":689,"2018":331,"2019":690,"2020":353,"2021":567,"2022":130,"2023":357},82,60,55,102,0.51,{"1995":421,"1999":165,"2001":167,"2002":532,"2003":107,"2004":165,"2005":111,"2007":693,"2008":694,"2009":287,"2010":445,"2011":695,"2012":119,"2013":319,"2014":318,"2015":696,"2016":338,"2017":118,"2018":697,"2019":219,"2020":698,"2021":341,"2022":423,"2023":111},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":28,"impactFactorByYear":28,"i10Index":126,"i10IndexLast5Year":123,"totalPublication":570,"totalPublicationByYear":700,"totalCitation":701,"totalCitationByYear":702,"totalCitationPerPublication":703,"totalCitationPerPublicationByYear":704,"hindexLast5Year":46,"hindex":205},{"0":48,"1999":146,"2000":47,"2001":45,"2002":40,"2003":199,"2004":123,"2005":42,"2006":123,"2007":145,"2008":145,"2009":46,"2010":49,"2011":47,"2012":47,"2013":49,"2014":45,"2015":45,"2016":157,"2017":40},425,{"2008":42,"2009":357,"2010":47,"2011":51,"2012":199,"2013":135,"2014":323,"2015":51,"2016":278,"2017":69,"2018":69,"2019":137,"2020":142,"2021":140,"2022":148,"2023":122,"2024":202,"2025":135,"2026":126},2.25,{"2008":169,"2009":705,"2010":706,"2011":707,"2012":342,"2013":42,"2014":636,"2015":708,"2016":709,"2017":69},1.6,1.57,1.36,3.75,0.54,{"id":711,"createTime":712,"updateTime":382,"relativeEntities":713,"slug":714,"properties":715,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":28,"translateLanguages":28,"viewCount":150,"subjectFields":727,"manageAffiliations":728,"indexDatabases":729,"url":730,"thumbnailPath":731,"statistic":732,"gsStatistic":738,"type":55,"analyzePriority":28},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":716,"issn":717,"title":719,"introduce":722,"gsId":725},{"VOID":15},{"VOID":718},"28155637",{"EN":720,"VI":721},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":723,"VI":724},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":726},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":32,"impactFactorByYear":733,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":329,"totalPublicationByYear":735,"totalCitation":134,"totalCitationByYear":736,"totalCitationPerPublication":524,"totalCitationPerPublicationByYear":737,"hindexLast5Year":123,"hindex":123},{"2024":734},0.17,{"2022":136,"2023":278,"2024":142},{"2022":357,"2023":126,"2024":123},{"2022":169,"2023":224,"2024":165},{"impactFactor":28,"impactFactorByYear":28,"i10Index":45,"i10IndexLast5Year":45,"totalPublication":330,"totalPublicationByYear":739,"totalCitation":154,"totalCitationByYear":740,"totalCitationPerPublication":741,"totalCitationPerPublicationByYear":742,"hindexLast5Year":46,"hindex":46},{"0":123,"2022":134,"2023":136,"2024":69,"2025":145},{"2023":46,"2024":136,"2025":201,"2026":278},1.22,{"2023":113,"2024":340,"2025":743},4.56,{"id":745,"createTime":746,"updateTime":747,"relativeEntities":748,"slug":749,"properties":750,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":762,"manageAffiliations":763,"indexDatabases":771,"url":817,"thumbnailPath":28,"statistic":818,"gsStatistic":850,"type":55,"analyzePriority":28},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":751,"eissn":752,"issn":754,"title":756,"introduce":758,"gsId":760},{"VOID":15},{"VOID":753},"26159783",{"VOID":755},"08667187",{"EN":757},"Vietnam Journal of Earth Sciences",{"EN":759},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":761},"5htfr3YAAAAJ",[],[764],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":765,"slug":28,"properties":766,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":770,"statistic":28},[],{"title":767,"country":768,"abbreviation":769},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[772,789,800],{"id":773,"indexDatabase":774,"url":784,"indexYears":785,"academicFieldIds":786,"indexDatabaseRanking":788},"6ace2085-a177-4a27-b309-8813b832111e",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":776,"label":777,"description":779,"key":781,"publicationTags":782,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":778,"VI":778},"Scopus - Elsevier",{"EN":778,"VI":780},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[783],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[787],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":790,"indexDatabase":791,"url":796,"indexYears":797,"academicFieldIds":798,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":792,"label":793,"description":794,"key":94,"publicationTags":795,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[799],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf",{"id":801,"indexDatabase":802,"url":814,"indexYears":28,"academicFieldIds":815,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":810,"publicationTags":811,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":806,"VI":806},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":808,"VI":809},"ESCI database","Cơ sở dữ liệu ESCI","esci",[812,813],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[816],"0db73426-2364-455f-81a4-efe0f91d712e","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":879,"manageAffiliations":880,"indexDatabases":881,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},"a3b0c722-fc8f-481d-8eac-3a087161dc71","2024-09-23T09:45:38.114+00:00","2025-11-21T10:06:12.473+00:00",[],"Bioinformatics-Oxford-England-",{"issn":874,"title":876},{"VOID":875},"13674811",{"VOID":877},"Bioinformatics (Oxford, England)","PENDING",[],[],[882],{"id":883,"indexDatabase":884,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},"ef6a61ec-66ee-45a5-a825-b269fc32f57b",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":885,"label":886,"description":887,"key":781,"publicationTags":888,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F17945","1985-2025","SCOPUS__Q1",{"meta":893,"data":895},{"total":894},"310",[896,939,1245,1559,1759,1950,2059,2251,2430,2650],{"id":897,"createTime":898,"updateTime":898,"relativeEntities":899,"slug":900,"properties":901,"entityType":906,"verifyStatus":878,"verifyTime":898,"verifyNote":907,"languages":908,"translateLanguages":28,"viewCount":32,"primaryUrl":909,"fullTextUrl":28,"authors":910,"publicationType":911,"publisherRelationship":912,"citationCount":28,"citationInfo":28,"publishDate":934,"publishYear":935,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":936,"openAccess":28,"references":937,"isForceReanalyzing":938},"a2f6f30d-cc0d-4914-b1b2-e7d977b0ee4b","2024-09-23T09:45:38.085+00:00",[],"Tissue-specific-network-based-genome-wide-study-of-amygdala-imaging-phenotypes-to-identify-functional-interaction-modules",{"title":902,"doi":904},{"EN":903},"Tissue-specific network-based genome wide study of amygdala imaging phenotypes to identify functional interaction modules",{"VOID":905},"10.1093\u002Fbioinformatics\u002Fbtx344","PUBLICATION","Author title is blank",[31],"https:\u002F\u002Fwww.ncbi.nlm.nih.gov\u002Fpubmed\u002F28575147",[],"ARTICLE",{"url":28,"publisher":913,"properties":927},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":914,"slug":872,"properties":915,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":918,"manageAffiliations":919,"indexDatabases":920,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":916,"title":917},{"VOID":875},{"VOID":877},[],[],[921],{"id":883,"indexDatabase":922,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":923,"label":924,"description":925,"key":781,"publicationTags":926,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":928,"pages":930,"volume":932},{"VOID":929},"20",{"VOID":931},"",{"VOID":933},"33","2017-10-15",2017,[891],[],false,{"id":940,"createTime":941,"updateTime":942,"relativeEntities":943,"slug":944,"properties":945,"entityType":906,"verifyStatus":26,"verifyTime":941,"verifyNote":961,"languages":962,"translateLanguages":963,"viewCount":32,"primaryUrl":964,"fullTextUrl":28,"authors":965,"publicationType":911,"publisherRelationship":1019,"citationCount":1041,"citationInfo":1042,"publishDate":1055,"publishYear":1043,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1056,"openAccess":28,"references":1057,"isForceReanalyzing":938},"284f9ba5-6b59-497c-ae4d-6d1576724b87","2024-11-28T07:13:07.208+00:00","2025-01-05T13:10:46.889+00:00",[],"featureCounts-an-efficient-general-purpose-program-for-assigning-sequence-reads-to-genomic-features",{"mag":946,"keywords":948,"openalex":949,"abstract":951,"title":954,"pm":957,"doi":959},{"VOID":947},"2138207763",{"VI":931},{"VOID":950},"W2138207763",{"VI":952,"EN":953},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:p>Động lực: Các công nghệ giải trình tự thế hệ tiếp theo tạo ra hàng triệu đoạn chuỗi ngắn, thường được định sẵn vào một bộ gen tham chiếu. Trong nhiều ứng dụng, thông tin chính cần thiết để phân tích hạ nguồn là số lượng đoạn chuỗi ánh xạ tới mỗi đặc điểm gen, ví dụ như mỗi exon hoặc mỗi gen. Quá trình đếm các đoạn chuỗi được gọi là tóm tắt đoạn chuỗi. Tóm tắt đoạn chuỗi là cần thiết cho nhiều phân tích gen khác nhau nhưng đến nay vẫn chưa nhận được nhiều sự chú ý trong tài liệu khoa học.\u003C\u002Fjats:p>\n               \u003Cjats:p>Kết quả: Chúng tôi giới thiệu featureCounts, một chương trình tóm tắt đoạn chuỗi thích hợp cho việc đếm các đoạn chuỗi được tạo ra từ các thí nghiệm giải trình tự RNA hoặc DNA gen. featureCounts thực hiện các kỹ thuật băm nhiễm sắc thể và chặn đặc điểm rất hiệu quả. Nó nhanh hơn nhiều so với các phương pháp hiện có (nhanh hơn một bậc độ cho tóm tắt cấp độ gen) và yêu cầu ít bộ nhớ máy tính hơn. Nó hoạt động với cả đoạn chuỗi đơn lẻ hoặc đôi và cung cấp một loạt tùy chọn phù hợp cho các ứng dụng giải trình tự khác nhau.\u003C\u002Fjats:p>\n               \u003Cjats:p>Tình trạng sẵn có và thực thi: featureCounts có sẵn theo Giấy phép Công cộng GNU và là một phần của gói phần mềm Subread (http:\u002F\u002Fsubread.sourceforge.net) hoặc Rsubread (http:\u002F\u002Fwww.bioconductor.org).\u003C\u002Fjats:p>\n               \u003Cjats:p>Liên hệ: shi@wehi.edu.au\u003C\u002Fjats:p>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Motivation: Next-generation sequencing technologies generate millions of short sequence reads, which are usually aligned to a reference genome. In many applications, the key information required for downstream analysis is the number of reads mapping to each genomic feature, for example to each exon or each gene. The process of counting reads is called read summarization. Read summarization is required for a great variety of genomic analyses but has so far received relatively little attention in the literature.\u003C\u002Fjats:p>\n               \u003Cjats:p>Results: We present featureCounts, a read summarization program suitable for counting reads generated from either RNA or genomic DNA sequencing experiments. featureCounts implements highly efficient chromosome hashing and feature blocking techniques. It is considerably faster than existing methods (by an order of magnitude for gene-level summarization) and requires far less computer memory. It works with either single or paired-end reads and provides a wide range of options appropriate for different sequencing applications.\u003C\u002Fjats:p>\n               \u003Cjats:p>Availability and implementation:   featureCounts is available under GNU General Public License as part of the Subread (http:\u002F\u002Fsubread.sourceforge.net) or Rsubread (http:\u002F\u002Fwww.bioconductor.org) software packages.\u003C\u002Fjats:p>\n               \u003Cjats:p>Contact:   shi@wehi.edu.au\u003C\u002Fjats:p>",{"EN":955,"VI":956},"featureCounts: an efficient general purpose program for assigning sequence reads to genomic features","featureCounts: một chương trình hiệu quả đa năng để phân bổ các đoạn chuỗi vào các đặc điểm gen",{"VOID":958},"24227677",{"VOID":960},"10.1093\u002Fbioinformatics\u002Fbtt656","Auto Verify",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F30\u002F7\u002F923\u002F232889",[966,985,1002],{"id":967,"sortIndex":32,"researcher":28,"roles":968,"affiliations":969,"properties":978,"displayName":982,"givenName":28,"familyName":28},"1693f42c-f4c0-4155-88aa-cc4c9f396255",[],[970],{"id":971,"sortIndex":32,"affiliation":972,"properties":28},"408865da-b953-4256-b377-92473fd7ecae",{"id":971,"createTime":28,"updateTime":28,"relativeEntities":973,"slug":28,"properties":974,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":977,"statistic":28},[],{"title":975},{"EN":976},"1 Bioinformatics Division, The Walter and Eliza Hall Institute of Medical Research, 1G Royal Parade, Parkville, VIC 3052, 2Department of Computing and Information Systems and 3Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia",[],{"orcid":979,"title":981,"openalex":983},{"VOID":980},"https:\u002F\u002Forcid.org\u002F0000-0002-9746-2839",{"EN":982},"Yang Liao",{"VOID":984},"A5022244006",{"id":986,"sortIndex":40,"researcher":28,"roles":987,"affiliations":988,"properties":995,"displayName":999,"givenName":28,"familyName":28},"1f7eeab1-65a5-453c-b2e4-77164897fbf2",[],[989],{"id":971,"sortIndex":32,"affiliation":990,"properties":28},{"id":971,"createTime":28,"updateTime":28,"relativeEntities":991,"slug":28,"properties":992,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":994,"statistic":28},[],{"title":993},{"EN":976},[],{"orcid":996,"title":998,"openalex":1000},{"VOID":997},"https:\u002F\u002Forcid.org\u002F0000-0001-9221-2892",{"EN":999},"Gordon K. Smyth",{"VOID":1001},"A5054704071",{"id":1003,"sortIndex":123,"researcher":28,"roles":1004,"affiliations":1005,"properties":1012,"displayName":1016,"givenName":28,"familyName":28},"5656f499-6958-4510-9cf1-f7dedea81d65",[],[1006],{"id":971,"sortIndex":32,"affiliation":1007,"properties":28},{"id":971,"createTime":28,"updateTime":28,"relativeEntities":1008,"slug":28,"properties":1009,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1011,"statistic":28},[],{"title":1010},{"EN":976},[],{"orcid":1013,"title":1015,"openalex":1017},{"VOID":1014},"https:\u002F\u002Forcid.org\u002F0000-0003-1182-7735",{"EN":1016},"Wei Shi",{"VOID":1018},"A5076240767",{"url":28,"publisher":1020,"properties":1034},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1021,"slug":872,"properties":1022,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1025,"manageAffiliations":1026,"indexDatabases":1027,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1023,"title":1024},{"VOID":875},{"VOID":877},[],[],[1028],{"id":883,"indexDatabase":1029,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1030,"label":1031,"description":1032,"key":781,"publicationTags":1033,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":1035,"pages":1037,"volume":1039},{"VOID":1036},"7",{"VOID":1038},"923-930",{"VOID":1040},"30",19489,{"total":1041,"publishYear":1043,"statisticByYear":1044},2014,{"2012":40,"2013":45,"2014":352,"2015":1045,"2016":1046,"2017":1047,"2018":1048,"2019":1049,"2020":1050,"2021":1051,"2022":1052,"2023":1053,"2024":1054},110,269,631,1007,1522,2280,2935,3433,3789,3342,"2014-04-01",[891],[1058,1061,1064,1068,1072,1076,1080,1084,1088,1091,1095,1099,1103,1107,1111,1115,1119,1123,1126,1130,1134,1138,1142,1145,1149,1153,1157,1161,1165,1169,1173,1176,1180,1184,1188,1192,1196,1200,1204,1208,1212,1215,1218,1222,1226,1230,1234,1237,1241],{"id":28,"text":1059,"url":28,"identifiers":1060},"Aboyoun, 2013, GenomicRanges: representation and manipulation of genomic intervals",{},{"id":28,"text":1062,"url":28,"identifiers":1063},"Anders, 2013, HTSeq: analysing high-throughput sequencing data with Python",{},{"id":28,"text":1065,"url":28,"identifiers":1066},"Anders, 2010, Differential expression analysis for sequence count data, Genome Biol., 11, R106, 10.1186\u002Fgb-2010-11-10-r106",{"doi":1067},"10.1186\u002Fgb-2010-11-10-r106",{"id":28,"text":1069,"url":28,"identifiers":1070},"Anders, 2012, Detecting differential usage of exons from RNA-seq data, Genome Res., 22, 2008, 10.1101\u002Fgr.133744.111",{"doi":1071},"10.1101\u002Fgr.133744.111",{"id":28,"text":1073,"url":28,"identifiers":1074},"Anders, 2013, Count-based differential expression analysis of RNA sequencing data using R and Bioconductor, Nat. Protoc., 8, 1765, 10.1038\u002Fnprot.2013.099",{"doi":1075},"10.1038\u002Fnprot.2013.099",{"id":28,"text":1077,"url":28,"identifiers":1078},"Auer, 2011, A two-stage Poisson model for testing RNA-seq data, Statistical Applications in Genetics and Molecular Biology, 10, 1, 10.2202\u002F1544-6115.1627",{"doi":1079},"10.2202\u002F1544-6115.1627",{"id":28,"text":1081,"url":28,"identifiers":1082},"Bhattacharyya, 2013, Genome-wide hydroxymethylation tested using the help-gt assay shows redistribution in cancer, Nucleic Acids Res., 41, e157, 10.1093\u002Fnar\u002Fgkt601",{"doi":1083},"10.1093\u002Fnar\u002Fgkt601",{"id":28,"text":1085,"url":28,"identifiers":1086},"Bradnam, 2013, Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species, Gigascience, 2, 10, 10.1186\u002F2047-217X-2-10",{"doi":1087},"10.1186\u002F2047-217X-2-10",{"id":28,"text":1089,"url":28,"identifiers":1090},"Brent Lab, 2013, GTF2.2: a Gene Annotation Format",{},{"id":28,"text":1092,"url":28,"identifiers":1093},"Flicek, 2012, Ensembl 2012, Nucleic Acids Res., 40, D84, 10.1093\u002Fnar\u002Fgkr991",{"doi":1094},"10.1093\u002Fnar\u002Fgkr991",{"id":28,"text":1096,"url":28,"identifiers":1097},"Fonseca, 2012, Tools for mapping high-throughput sequencing data, Bioinformatics, 28, 3169, 10.1093\u002Fbioinformatics\u002Fbts605",{"doi":1098},"10.1093\u002Fbioinformatics\u002Fbts605",{"id":28,"text":1100,"url":28,"identifiers":1101},"Gentleman, 2004, Bioconductor: open software development for computational biology and bioinformatics, Genome Biol., 5, R80, 10.1186\u002Fgb-2004-5-10-r80",{"doi":1102},"10.1186\u002Fgb-2004-5-10-r80",{"id":28,"text":1104,"url":28,"identifiers":1105},"Hardcastle, 2010, baySeq: Empirical Bayesian methods for identifying differential expression in sequence count data, BMC Bioinformatics, 11, 422, 10.1186\u002F1471-2105-11-422",{"doi":1106},"10.1186\u002F1471-2105-11-422",{"id":28,"text":1108,"url":28,"identifiers":1109},"Harris, 2010, Comparison of sequencing-based methods to profile DNA methylation and identification of monoallelic epigenetic modifications, Nat. Biotechnol., 28, 1097, 10.1038\u002Fnbt.1682",{"doi":1110},"10.1038\u002Fnbt.1682",{"id":28,"text":1112,"url":28,"identifiers":1113},"Howard, 2013, De novo high-coverage sequencing and annotated assemblies of the Budgerigar genome, GigaScience Database, 10.5524\u002F100059",{"doi":1114},"10.5524\u002F100059",{"id":28,"text":1116,"url":28,"identifiers":1117},"Kent, 2002, The human genome browser at UCSC, Genome Res., 12, 996, 10.1101\u002Fgr.229102",{"doi":1118},"10.1101\u002Fgr.229102",{"id":28,"text":1120,"url":28,"identifiers":1121},"Langmead, 2009, Ultrafast and memory-efficient alignment of short DNA sequences to the human genome, Genome Biol., 10, 10.1186\u002Fgb-2009-10-3-r25",{"doi":1122},"10.1186\u002Fgb-2009-10-3-r25",{"id":28,"text":1124,"url":28,"identifiers":1125},"Law, 2013, Voom! precision weights unlock linear model analysis tools for RNA-seq read counts",{},{"id":28,"text":1127,"url":28,"identifiers":1128},"Li, 2011, RSEM: accurate transcript quantification from RNA-Seq data with or without a reference genome, BMC Bioinformatics, 12, 323, 10.1186\u002F1471-2105-12-323",{"doi":1129},"10.1186\u002F1471-2105-12-323",{"id":28,"text":1131,"url":28,"identifiers":1132},"Li, 2009, Fast and accurate short read alignment with Burrows–Wheeler transform, Bioinformatics, 25, 1754, 10.1093\u002Fbioinformatics\u002Fbtp324",{"doi":1133},"10.1093\u002Fbioinformatics\u002Fbtp324",{"id":28,"text":1135,"url":28,"identifiers":1136},"Li, 2009, The sequence alignment\u002Fmap format and SAMtools, Bioinformatics, 25, 2078, 10.1093\u002Fbioinformatics\u002Fbtp352",{"doi":1137},"10.1093\u002Fbioinformatics\u002Fbtp352",{"id":28,"text":1139,"url":28,"identifiers":1140},"Li, 2012, Normalization, testing, and false discovery rate estimation for RNA-sequencing data, Biostatistics, 13, 523, 10.1093\u002Fbiostatistics\u002Fkxr031",{"doi":1141},"10.1093\u002Fbiostatistics\u002Fkxr031",{"id":28,"text":1143,"url":28,"identifiers":1144},"Liao, 2013, The Subread package: a toolkit for processing next-gen sequencing data",{},{"id":28,"text":1146,"url":28,"identifiers":1147},"Liao, 2013, The Subread aligner: fast, accurate and scalable read mapping by seed-and-vote, Nucleic Acids Res., 41, e108, 10.1093\u002Fnar\u002Fgkt214",{"doi":1148},"10.1093\u002Fnar\u002Fgkt214",{"id":28,"text":1150,"url":28,"identifiers":1151},"Man, 2013, The transcription factor IRF4 is essential for TCR affinity-mediated metabolic programming and clonal expansion of T cells, Nat. Immunol., 14, 1155, 10.1038\u002Fni.2710",{"doi":1152},"10.1038\u002Fni.2710",{"id":28,"text":1154,"url":28,"identifiers":1155},"Marco-Sola, 2012, The GEM mapper: fast, accurate and versatile alignment by filtration, Nat. Methods, 9, 1185, 10.1038\u002Fnmeth.2221",{"doi":1156},"10.1038\u002Fnmeth.2221",{"id":28,"text":1158,"url":28,"identifiers":1159},"McCarthy, 2012, Differential expression analysis of multifactor RNA-Seq experiments with respect to biological variation, Nucleic Acids Res., 40, 4288, 10.1093\u002Fnar\u002Fgks042",{"doi":1160},"10.1093\u002Fnar\u002Fgks042",{"id":28,"text":1162,"url":28,"identifiers":1163},"Metzker, 2009, Sequencing technologiesthe next generation, Nature Rev. Genet., 11, 31, 10.1038\u002Fnrg2626",{"doi":1164},"10.1038\u002Fnrg2626",{"id":28,"text":1166,"url":28,"identifiers":1167},"Nookaew, 2012, A comprehensive comparison of RNA-Seq-based transcriptome analysis from reads to differential gene expression and cross-comparison with microarrays: a case study in Saccharomyces cerevisiae, Nucleic Acids Res., 40, 10084, 10.1093\u002Fnar\u002Fgks804",{"doi":1168},"10.1093\u002Fnar\u002Fgks804",{"id":28,"text":1170,"url":28,"identifiers":1171},"Oshlack, 2010, From RNA-seq reads to differential expression results, Genome Biol., 11, 220, 10.1186\u002Fgb-2010-11-12-220",{"doi":1172},"10.1186\u002Fgb-2010-11-12-220",{"id":28,"text":1174,"url":28,"identifiers":1175},"Pages, 2013, IRanges: infrastructure for manipulating intervals on sequences",{},{"id":28,"text":1177,"url":28,"identifiers":1178},"Pal, 2013, Global changes in the mammary epigenome are induced by hormonal cues and coordinated by Ezh2, Cell Rep., 3, 411, 10.1016\u002Fj.celrep.2012.12.020",{"doi":1179},"10.1016\u002Fj.celrep.2012.12.020",{"id":28,"text":1181,"url":28,"identifiers":1182},"Park, 2009, Chip–seq: advantages and challenges of a maturing technology, Nat. Rev. Genet., 10, 669, 10.1038\u002Fnrg2641",{"doi":1183},"10.1038\u002Fnrg2641",{"id":28,"text":1185,"url":28,"identifiers":1186},"Pruitt, 2012, NCBI Reference Sequences (RefSeq): current status, new features and genome annotation policy, Nucleic Acids Res., 40, D130, 10.1093\u002Fnar\u002Fgkr1079",{"doi":1187},"10.1093\u002Fnar\u002Fgkr1079",{"id":28,"text":1189,"url":28,"identifiers":1190},"Quinlan, 2010, BEDTools: a flexible suite of utilities for comparing genomic features, Bioinformatics, 26, 841, 10.1093\u002Fbioinformatics\u002Fbtq033",{"doi":1191},"10.1093\u002Fbioinformatics\u002Fbtq033",{"id":28,"text":1193,"url":28,"identifiers":1194},"Rapaport, 2013, Comprehensive evaluation of differential gene expression analysis methods for Rna-seq data, Genome Biol., 14, R95, 10.1186\u002Fgb-2013-14-9-r95",{"doi":1195},"10.1186\u002Fgb-2013-14-9-r95",{"id":28,"text":1197,"url":28,"identifiers":1198},"Reyes, 2013, Drift and conservation of differential exon usage across tissues in primate species, Proc. Natl Acad. Sci. USA, 110, 15377, 10.1073\u002Fpnas.1307202110",{"doi":1199},"10.1073\u002Fpnas.1307202110",{"id":28,"text":1201,"url":28,"identifiers":1202},"Robinson, 2010, edgeR: a Bioconductor package for differential expression analysis of digital gene expression data, Bioinformatics, 26, 139, 10.1093\u002Fbioinformatics\u002Fbtp616",{"doi":1203},"10.1093\u002Fbioinformatics\u002Fbtp616",{"id":28,"text":1205,"url":28,"identifiers":1206},"Ross-Innes, 2012, Differential oestrogen receptor binding is associated with clinical outcome in breast cancer, Nature, 481, 389, 10.1038\u002Fnature10730",{"doi":1207},"10.1038\u002Fnature10730",{"id":28,"text":1209,"url":28,"identifiers":1210},"Schuster, 2008, Next-generation sequencing transforms today’s biology, Nat. Methods, 5, 16, 10.1038\u002Fnmeth1156",{"doi":1211},"10.1038\u002Fnmeth1156",{"id":28,"text":1213,"url":28,"identifiers":1214},"Shi, 2013, Rsubread: an R package for the alignment, summarization and analyses of next-generation sequencing data",{},{"id":28,"text":1216,"url":28,"identifiers":1217},"Shi, 2013, Subread\u002FRsubread Users Guide",{},{"id":28,"text":1219,"url":28,"identifiers":1220},"Shi, 2006, The microarray quality control (MAQC) project shows inter-and intraplatform reproducibility of gene expression measurements, Nat. Biotechnol., 24, 1151, 10.1038\u002Fnbt1239",{"doi":1221},"10.1038\u002Fnbt1239",{"id":28,"text":1223,"url":28,"identifiers":1224},"Trapnell, 2009, TopHat: discovering splice junctions with RNA-seq, Bioinformatics, 25, 1105, 10.1093\u002Fbioinformatics\u002Fbtp120",{"doi":1225},"10.1093\u002Fbioinformatics\u002Fbtp120",{"id":28,"text":1227,"url":28,"identifiers":1228},"Trapnell, 2010, Transcript assembly and quantification by RNA-seq reveals unannotated transcripts and isoform switching during cell differentiation, Nat. Biotechnol., 28, 511, 10.1038\u002Fnbt.1621",{"doi":1229},"10.1038\u002Fnbt.1621",{"id":28,"text":1231,"url":28,"identifiers":1232},"Valouev, 2008, Genome-wide analysis of transcription factor binding sites based on chip-seq data, Nat. Methods, 5, 829, 10.1038\u002Fnmeth.1246",{"doi":1233},"10.1038\u002Fnmeth.1246",{"id":28,"text":1235,"url":28,"identifiers":1236},"Wellcome Trust Sanger Institute, 2013, GFF (General Feature Format) specifications document",{},{"id":28,"text":1238,"url":28,"identifiers":1239},"Wu, 2013, A new shrinkage estimator for dispersion improves differential expression detection in RNA-seq data, Biostatistics, 14, 232, 10.1093\u002Fbiostatistics\u002Fkxs033",{"doi":1240},"10.1093\u002Fbiostatistics\u002Fkxs033",{"id":28,"text":1242,"url":28,"identifiers":1243},"Zhang, 2008, Model-based analysis of ChIP-Seq (MACS), Genome Biol, 9, R137, 10.1186\u002Fgb-2008-9-9-r137",{"doi":1244},"10.1186\u002Fgb-2008-9-9-r137",{"id":1246,"createTime":1247,"updateTime":1247,"relativeEntities":1248,"slug":1249,"properties":1250,"entityType":906,"verifyStatus":26,"verifyTime":1247,"verifyNote":961,"languages":1265,"translateLanguages":28,"viewCount":32,"primaryUrl":1266,"fullTextUrl":28,"authors":1267,"publicationType":911,"publisherRelationship":1484,"citationCount":1506,"citationInfo":1507,"publishDate":1520,"publishYear":1508,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1521,"openAccess":28,"references":1522,"isForceReanalyzing":938},"9fc5e271-231a-4b36-add0-5edaaf9c9e12","2025-01-26T00:08:26.868+00:00",[],"Geneious-Basic-An-integrated-and-extendable-desktop-software-platform-for-the-organization-and-analysis-of-sequence-data",{"mag":1251,"pmc":1253,"openalex":1255,"abstract":1257,"title":1259,"pm":1261,"doi":1263},{"VOID":1252},"2128880918",{"VOID":1254},"3371832",{"VOID":1256},"W2128880918",{"EN":1258},"\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Summary: The two main functions of bioinformatics are the organization and analysis of biological data using computational resources. Geneious Basic has been designed to be an easy-to-use and flexible desktop software application framework for the organization and analysis of biological data, with a focus on molecular sequences and related data types. It integrates numerous industry-standard discovery analysis tools, with interactive visualizations to generate publication-ready images. One key contribution to researchers in the life sciences is the Geneious public application programming interface (API) that affords the ability to leverage the existing framework of the Geneious Basic software platform for virtually unlimited extension and customization. The result is an increase in the speed and quality of development of computation tools for the life sciences, due to the functionality and graphical user interface available to the developer through the public API. Geneious Basic represents an ideal platform for the bioinformatics community to leverage existing components and to integrate their own specific requirements for the discovery, analysis and visualization of biological data.\u003C\u002Fjats:p>\n               \u003Cjats:p>Availability and implementation: Binaries and public API freely available for download at http:\u002F\u002Fwww.geneious.com\u002Fbasic, implemented in Java and supported on Linux, Apple OSX and MS Windows. The software is also available from the Bio-Linux package repository at http:\u002F\u002Fnebc.nerc.ac.uk\u002Fnews\u002Fgeneiousonbl.\u003C\u002Fjats:p>\n               \u003Cjats:p>Contact:  peter@biomatters.com\u003C\u002Fjats:p>",{"EN":1260},"Geneious Basic: An integrated and extendable desktop software platform for the organization and analysis of sequence data",{"VOID":1262},"22543367",{"VOID":1264},"10.1093\u002Fbioinformatics\u002Fbts199",[31],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F28\u002F12\u002F1647\u002F267326",[1268,1285,1300,1317,1332,1347,1362,1377,1392,1407,1422,1437,1452,1467],{"id":1269,"sortIndex":32,"researcher":28,"roles":1270,"affiliations":1271,"properties":1280,"displayName":1282,"givenName":28,"familyName":28},"56148495-6daf-4ced-852e-d3e8aedd8e9a",[],[1272],{"id":1273,"sortIndex":32,"affiliation":1274,"properties":28},"8994b9a8-09bf-4963-a647-d4e78df292fb",{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1275,"slug":28,"properties":1276,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1279,"statistic":28},[],{"title":1277},{"EN":1278},"1 Biomatters Ltd., 2\u002F76 Anzac Avenue, Auckland, 1010, New Zealand, 2School of Agriculture and Food Science, University of Queensland, Brisbane, 4072, Australia and 3Department of Computer Science, University of Auckland, Auckland, New Zealand",[],{"title":1281,"openalex":1283},{"EN":1282},"Matthew D. Kearse",{"VOID":1284},"A5046781938",{"id":1286,"sortIndex":40,"researcher":28,"roles":1287,"affiliations":1288,"properties":1295,"displayName":1297,"givenName":28,"familyName":28},"718e312f-9382-47c9-9bbd-ef1239df31d6",[],[1289],{"id":1273,"sortIndex":32,"affiliation":1290,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1291,"slug":28,"properties":1292,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1294,"statistic":28},[],{"title":1293},{"EN":1278},[],{"title":1296,"openalex":1298},{"EN":1297},"Richard Moir",{"VOID":1299},"A5022923330",{"id":1301,"sortIndex":123,"researcher":28,"roles":1302,"affiliations":1303,"properties":1310,"displayName":1314,"givenName":28,"familyName":28},"01474743-e0ba-4f46-b7ba-4578a4c9f8de",[],[1304],{"id":1273,"sortIndex":32,"affiliation":1305,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1306,"slug":28,"properties":1307,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1309,"statistic":28},[],{"title":1308},{"EN":1278},[],{"orcid":1311,"title":1313,"openalex":1315},{"VOID":1312},"https:\u002F\u002Forcid.org\u002F0000-0003-2789-0480",{"EN":1314},"Amy G. Wilson",{"VOID":1316},"A5033023543",{"id":1318,"sortIndex":42,"researcher":28,"roles":1319,"affiliations":1320,"properties":1327,"displayName":1329,"givenName":28,"familyName":28},"ad42e782-a5d9-4b70-9763-bb80eaa60c3c",[],[1321],{"id":1273,"sortIndex":32,"affiliation":1322,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1323,"slug":28,"properties":1324,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1326,"statistic":28},[],{"title":1325},{"EN":1278},[],{"title":1328,"openalex":1330},{"EN":1329},"Steven Stones-Havas",{"VOID":1331},"A5056633769",{"id":1333,"sortIndex":45,"researcher":28,"roles":1334,"affiliations":1335,"properties":1342,"displayName":1344,"givenName":28,"familyName":28},"b426bb3b-e987-45f7-95e0-03258d77840e",[],[1336],{"id":1273,"sortIndex":32,"affiliation":1337,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1338,"slug":28,"properties":1339,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1341,"statistic":28},[],{"title":1340},{"EN":1278},[],{"title":1343,"openalex":1345},{"EN":1344},"Matthew Cheung",{"VOID":1346},"A5112601052",{"id":1348,"sortIndex":46,"researcher":28,"roles":1349,"affiliations":1350,"properties":1357,"displayName":1359,"givenName":28,"familyName":28},"ad4b873e-d56e-4ffc-bc87-84fafecf61a7",[],[1351],{"id":1273,"sortIndex":32,"affiliation":1352,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1353,"slug":28,"properties":1354,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1356,"statistic":28},[],{"title":1355},{"EN":1278},[],{"title":1358,"openalex":1360},{"EN":1359},"Shane Sturrock",{"VOID":1361},"A5076410128",{"id":1363,"sortIndex":48,"researcher":28,"roles":1364,"affiliations":1365,"properties":1372,"displayName":1374,"givenName":28,"familyName":28},"b67588e9-0dac-4d66-aeac-48ef72e3e033",[],[1366],{"id":1273,"sortIndex":32,"affiliation":1367,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1368,"slug":28,"properties":1369,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1371,"statistic":28},[],{"title":1370},{"EN":1278},[],{"title":1373,"openalex":1375},{"EN":1374},"Simon Buxton",{"VOID":1376},"A5033252568",{"id":1378,"sortIndex":49,"researcher":28,"roles":1379,"affiliations":1380,"properties":1387,"displayName":1389,"givenName":28,"familyName":28},"2e6f22a1-a3eb-46f9-aba4-4b899e1099bb",[],[1381],{"id":1273,"sortIndex":32,"affiliation":1382,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1383,"slug":28,"properties":1384,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1386,"statistic":28},[],{"title":1385},{"EN":1278},[],{"title":1388,"openalex":1390},{"EN":1389},"Alex Cooper",{"VOID":1391},"A5110792587",{"id":1393,"sortIndex":357,"researcher":28,"roles":1394,"affiliations":1395,"properties":1402,"displayName":1404,"givenName":28,"familyName":28},"61761a57-322d-4af2-8624-df6fb7a94308",[],[1396],{"id":1273,"sortIndex":32,"affiliation":1397,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1398,"slug":28,"properties":1399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1401,"statistic":28},[],{"title":1400},{"EN":1278},[],{"title":1403,"openalex":1405},{"EN":1404},"Sidney Markowitz",{"VOID":1406},"A5003452560",{"id":1408,"sortIndex":145,"researcher":28,"roles":1409,"affiliations":1410,"properties":1417,"displayName":1419,"givenName":28,"familyName":28},"4ebaea24-0495-4a40-b1a0-be97379e9ba4",[],[1411],{"id":1273,"sortIndex":32,"affiliation":1412,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1413,"slug":28,"properties":1414,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1416,"statistic":28},[],{"title":1415},{"EN":1278},[],{"title":1418,"openalex":1420},{"EN":1419},"Chris Duran",{"VOID":1421},"A5042879860",{"id":1423,"sortIndex":205,"researcher":28,"roles":1424,"affiliations":1425,"properties":1432,"displayName":1434,"givenName":28,"familyName":28},"d6cad215-3aa5-42b1-95bc-a126710c85db",[],[1426],{"id":1273,"sortIndex":32,"affiliation":1427,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1428,"slug":28,"properties":1429,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1431,"statistic":28},[],{"title":1430},{"EN":1278},[],{"title":1433,"openalex":1435},{"EN":1434},"Tobias Thierer",{"VOID":1436},"A5031270105",{"id":1438,"sortIndex":47,"researcher":28,"roles":1439,"affiliations":1440,"properties":1447,"displayName":1449,"givenName":28,"familyName":28},"a84d6e2f-e413-494c-adaa-27e14d4a6203",[],[1441],{"id":1273,"sortIndex":32,"affiliation":1442,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1443,"slug":28,"properties":1444,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1446,"statistic":28},[],{"title":1445},{"EN":1278},[],{"title":1448,"openalex":1450},{"EN":1449},"Bruce Ashton",{"VOID":1451},"A5078003144",{"id":1453,"sortIndex":126,"researcher":28,"roles":1454,"affiliations":1455,"properties":1462,"displayName":1464,"givenName":28,"familyName":28},"da4cd871-2b1b-4d52-b4db-68b517f4d6d4",[],[1456],{"id":1273,"sortIndex":32,"affiliation":1457,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1458,"slug":28,"properties":1459,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1461,"statistic":28},[],{"title":1460},{"EN":1278},[],{"title":1463,"openalex":1465},{"EN":1464},"Peter Meintjes",{"VOID":1466},"A5020597078",{"id":1468,"sortIndex":146,"researcher":28,"roles":1469,"affiliations":1470,"properties":1477,"displayName":1481,"givenName":28,"familyName":28},"66e9a84c-4c6b-4753-971a-271feeaddd81",[],[1471],{"id":1273,"sortIndex":32,"affiliation":1472,"properties":28},{"id":1273,"createTime":28,"updateTime":28,"relativeEntities":1473,"slug":28,"properties":1474,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1476,"statistic":28},[],{"title":1475},{"EN":1278},[],{"orcid":1478,"title":1480,"openalex":1482},{"VOID":1479},"https:\u002F\u002Forcid.org\u002F0000-0003-4454-2576",{"EN":1481},"Alexei J. Drummond",{"VOID":1483},"A5079724732",{"url":28,"publisher":1485,"properties":1499},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1486,"slug":872,"properties":1487,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1490,"manageAffiliations":1491,"indexDatabases":1492,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1488,"title":1489},{"VOID":875},{"VOID":877},[],[],[1493],{"id":883,"indexDatabase":1494,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1495,"label":1496,"description":1497,"key":781,"publicationTags":1498,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":1500,"pages":1502,"volume":1504},{"VOID":1501},"12",{"VOID":1503},"1647-1649",{"VOID":1505},"28",17770,{"total":1506,"publishYear":1508,"statisticByYear":1509},2012,{"2012":352,"2013":207,"2014":1510,"2015":1511,"2016":561,"2017":1512,"2018":1513,"2019":1514,"2020":1515,"2021":1516,"2022":1517,"2023":1518,"2024":1519},152,565,1843,2200,2258,2289,2183,1795,1671,1437,"2012-06-15",[891],[1523,1527,1529,1533,1537,1541,1545,1547,1551,1555],{"id":28,"text":1524,"url":28,"identifiers":1525},"Altschul, 1990, Basic local alignment search tool, J. Mol. Biol., 215, 403, 10.1016\u002FS0022-2836(05)80360-2",{"doi":1526},"10.1016\u002FS0022-2836(05)80360-2",{"id":28,"text":931,"url":28,"identifiers":1528},{},{"id":28,"text":1530,"url":28,"identifiers":1531},"Field, 2006, Open software for biologists: from famine to feast, Nat. Biotechnol., 24, 801, 10.1038\u002Fnbt0706-801",{"doi":1532},"10.1038\u002Fnbt0706-801",{"id":28,"text":1534,"url":28,"identifiers":1535},"Goecks, 2010, Galaxy: a comprehensive approach for supporting accessible, reproducible, and transparent computational research in the life sciences, Genome Biol., 11, R86, 10.1186\u002Fgb-2010-11-8-r86",{"doi":1536},"10.1186\u002Fgb-2010-11-8-r86",{"id":28,"text":1538,"url":28,"identifiers":1539},"Lu, 2004, Vector NTI, a balanced all-in-one sequence analysis suite, Brief. Bioinform., 5, 378, 10.1093\u002Fbib\u002F5.4.378",{"doi":1540},"10.1093\u002Fbib\u002F5.4.378",{"id":28,"text":1542,"url":28,"identifiers":1543},"Masters, 2011, Species Delimitation - a Geneious plugin for the exploration of species boundaries, Mol. Ecol. Resour., 11, 154, 10.1111\u002Fj.1755-0998.2010.02896.x",{"doi":1544},"10.1111\u002Fj.1755-0998.2010.02896.x",{"id":28,"text":931,"url":28,"identifiers":1546},{},{"id":28,"text":1548,"url":28,"identifiers":1549},"Schatz, 2010, Cloud computing and the DNA data race, Nat. Biotechnol., 28, 691, 10.1038\u002Fnbt0710-691",{"doi":1550},"10.1038\u002Fnbt0710-691",{"id":28,"text":1552,"url":28,"identifiers":1553},"Smoot, 2010, Cytoscape 2.8: new features for data integration and network visualization, Bioinformatics, 27, 431, 10.1093\u002Fbioinformatics\u002Fbtq675",{"doi":1554},"10.1093\u002Fbioinformatics\u002Fbtq675",{"id":28,"text":1556,"url":28,"identifiers":1557},"Tamura, 2007, MEGA4: Molecular Evolutionary Genetics Analysis (MEGA) software version 4.0, Mol. Biol. Evol., 24, 1596, 10.1093\u002Fmolbev\u002Fmsm092",{"doi":1558},"10.1093\u002Fmolbev\u002Fmsm092",{"id":1560,"createTime":1561,"updateTime":1562,"relativeEntities":1563,"slug":1564,"properties":1565,"entityType":906,"verifyStatus":26,"verifyTime":1561,"verifyNote":961,"languages":1583,"translateLanguages":1584,"viewCount":32,"primaryUrl":1585,"fullTextUrl":28,"authors":1586,"publicationType":911,"publisherRelationship":1665,"citationCount":1687,"citationInfo":1688,"publishDate":1697,"publishYear":1689,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1698,"openAccess":28,"references":1699,"isForceReanalyzing":938},"6f7137d1-0bd5-44e9-b4a7-390f60fbae3e","2024-10-06T15:22:24.871+00:00","2025-01-05T13:11:44.495+00:00",[],"fastp-an-ultra-fast-all-in-one-FASTQ-preprocessor",{"mag":1566,"keywords":1568,"pmc":1569,"openalex":1571,"abstract":1573,"title":1576,"pm":1579,"doi":1581},{"VOID":1567},"2951912016",{"VI":931},{"VOID":1570},"6129281",{"VOID":1572},"W2951912016",{"VI":1574,"EN":1575},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Động lực\u003C\u002Fjats:title>\n                  \u003Cjats:p>Kiểm soát chất lượng và tiền xử lý các tệp FASTQ là rất cần thiết để cung cấp dữ liệu sạch cho các phân tích tiếp theo. Truyền thống, một công cụ khác nhau được sử dụng cho mỗi thao tác, chẳng hạn như kiểm soát chất lượng, cắt adapter và lọc chất lượng. Những công cụ này thường không đủ nhanh vì hầu hết được phát triển bằng các ngôn ngữ lập trình cấp cao (ví dụ: Python và Java) và cung cấp hỗ trợ đa luồng hạn chế. Việc đọc và tải dữ liệu nhiều lần cũng tạo ra sự chậm chạp và không hiệu quả trong xử lý I\u002FO.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Kết quả\u003C\u002Fjats:title>\n                  \u003Cjats:p>Chúng tôi đã phát triển fastp như một bộ tiền xử lý FASTQ siêu nhanh với những tính năng kiểm soát chất lượng và lọc dữ liệu hữu ích. Nó có thể thực hiện kiểm soát chất lượng, cắt adapter, lọc chất lượng, cắt giảm chất lượng theo từng đọc và nhiều thao tác khác chỉ với một lần quét dữ liệu FASTQ. Công cụ này được phát triển bằng C++ và có hỗ trợ đa luồng. Dựa trên đánh giá của chúng tôi, fastp nhanh hơn 2-5 lần so với các công cụ tiền xử lý FASTQ khác như Trimmomatic hoặc Cutadapt mặc dù thực hiện nhiều thao tác hơn những công cụ tương tự.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Khả năng truy cập và triển khai\u003C\u002Fjats:title>\n                  \u003Cjats:p>Mã nguồn mở và hướng dẫn tương ứng có sẵn tại https:\u002F\u002Fgithub.com\u002FOpenGene\u002Ffastp.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Motivation\u003C\u002Fjats:title>\n                  \u003Cjats:p>Quality control and preprocessing of FASTQ files are essential to providing clean data for downstream analysis. Traditionally, a different tool is used for each operation, such as quality control, adapter trimming and quality filtering. These tools are often insufficiently fast as most are developed using high-level programming languages (e.g. Python and Java) and provide limited multi-threading support. Reading and loading data multiple times also renders preprocessing slow and I\u002FO inefficient.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Results\u003C\u002Fjats:title>\n                  \u003Cjats:p>We developed fastp as an ultra-fast FASTQ preprocessor with useful quality control and data-filtering features. It can perform quality control, adapter trimming, quality filtering, per-read quality pruning and many other operations with a single scan of the FASTQ data. This tool is developed in C++ and has multi-threading support. Based on our evaluation, fastp is 2–5 times faster than other FASTQ preprocessing tools such as Trimmomatic or Cutadapt despite performing far more operations than similar tools.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Availability and implementation\u003C\u002Fjats:title>\n                  \u003Cjats:p>The open-source code and corresponding instructions are available at https:\u002F\u002Fgithub.com\u002FOpenGene\u002Ffastp.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>",{"EN":1577,"VI":1578},"fastp: an ultra-fast all-in-one FASTQ preprocessor","fastp: một công cụ tiền xử lý FASTQ siêu nhanh đa năng",{"VOID":1580},"30423086",{"VOID":1582},"10.1093\u002Fbioinformatics\u002Fbty560",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F34\u002F17\u002Fi884\u002F5093234",[1587,1614,1631,1648],{"id":1588,"sortIndex":32,"researcher":28,"roles":1589,"affiliations":1590,"properties":1607,"displayName":1611,"givenName":28,"familyName":28},"2e980b02-7c67-4e94-a099-564ce6a202b0",[],[1591,1599],{"id":1592,"sortIndex":32,"affiliation":1593,"properties":28},"d7c6ab78-6ec7-4f63-956a-a836a839b6c4",{"id":1592,"createTime":28,"updateTime":28,"relativeEntities":1594,"slug":28,"properties":1595,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1598,"statistic":28},[],{"title":1596},{"EN":1597},"Department of Bioinformatics, HaploX Biotechnology, Shenzhen, China",[],{"id":1600,"sortIndex":40,"affiliation":1601,"properties":28},"549aecf7-4651-4d3d-804f-197aff98e50d",{"id":1600,"createTime":28,"updateTime":28,"relativeEntities":1602,"slug":28,"properties":1603,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1606,"statistic":28},[],{"title":1604},{"VI":1605},"Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China",[],{"orcid":1608,"title":1610,"openalex":1612},{"VOID":1609},"https:\u002F\u002Forcid.org\u002F0000-0001-5799-653X",{"EN":1611},"Shifu Chen",{"VOID":1613},"A5002901852",{"id":1615,"sortIndex":40,"researcher":28,"roles":1616,"affiliations":1617,"properties":1624,"displayName":1628,"givenName":28,"familyName":28},"a9bea634-62b4-4d02-88f0-c44443af020a",[],[1618],{"id":1592,"sortIndex":32,"affiliation":1619,"properties":28},{"id":1592,"createTime":28,"updateTime":28,"relativeEntities":1620,"slug":28,"properties":1621,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1623,"statistic":28},[],{"title":1622},{"EN":1597},[],{"orcid":1625,"title":1627,"openalex":1629},{"VOID":1626},"https:\u002F\u002Forcid.org\u002F0000-0002-9319-2579",{"EN":1628},"Yanqing Zhou",{"VOID":1630},"A5052814282",{"id":1632,"sortIndex":123,"researcher":28,"roles":1633,"affiliations":1634,"properties":1641,"displayName":1645,"givenName":28,"familyName":28},"95b8bcc0-9f10-45a1-92dc-65552d8f7a9e",[],[1635],{"id":1592,"sortIndex":32,"affiliation":1636,"properties":28},{"id":1592,"createTime":28,"updateTime":28,"relativeEntities":1637,"slug":28,"properties":1638,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1640,"statistic":28},[],{"title":1639},{"EN":1597},[],{"orcid":1642,"title":1644,"openalex":1646},{"VOID":1643},"https:\u002F\u002Forcid.org\u002F0000-0003-2549-8880",{"EN":1645},"Yaru Chen",{"VOID":1647},"A5037446400",{"id":1649,"sortIndex":42,"researcher":28,"roles":1650,"affiliations":1651,"properties":1658,"displayName":1662,"givenName":28,"familyName":28},"e4a8e822-24fc-4cc2-9532-f356929f31ac",[],[1652],{"id":1600,"sortIndex":32,"affiliation":1653,"properties":28},{"id":1600,"createTime":28,"updateTime":28,"relativeEntities":1654,"slug":28,"properties":1655,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1657,"statistic":28},[],{"title":1656},{"VI":1605},[],{"orcid":1659,"title":1661,"openalex":1663},{"VOID":1660},"https:\u002F\u002Forcid.org\u002F0000-0001-7498-9892",{"EN":1662},"Jia Gu",{"VOID":1664},"A5100755117",{"url":28,"publisher":1666,"properties":1680},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1667,"slug":872,"properties":1668,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1671,"manageAffiliations":1672,"indexDatabases":1673,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1669,"title":1670},{"VOID":875},{"VOID":877},[],[],[1674],{"id":883,"indexDatabase":1675,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1676,"label":1677,"description":1678,"key":781,"publicationTags":1679,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":1681,"pages":1683,"volume":1685},{"VOID":1682},"17",{"VOID":1684},"i884-i890",{"VOID":1686},"34",14558,{"total":1687,"publishYear":1689,"statisticByYear":1690},2018,{"2016":123,"2017":123,"2018":51,"2019":1691,"2020":1692,"2021":1693,"2022":1694,"2023":1695,"2024":1696},211,865,1838,3193,4281,4142,"2018-09-01",[891],[1700,1703,1707,1711,1714,1718,1722,1726,1730,1734,1738,1741,1744,1748,1752,1756],{"id":28,"text":1701,"url":28,"identifiers":1702},"Andrews\n        S.\n           (2010) \nA quality control tool for high throughput sequence data. http:\u002F\u002Fwww.bioinformatics.babraham.ac.uk\u002Fprojects\u002Ffastqc\u002F.",{},{"id":28,"text":1704,"url":28,"identifiers":1705},"Bianchi, 2015, Noninvasive prenatal testing and incidental detection of occult maternal malignancies, JAMA, 314, 162, 10.1001\u002Fjama.2015.7120",{"doi":1706},"10.1001\u002Fjama.2015.7120",{"id":28,"text":1708,"url":28,"identifiers":1709},"Bolger, 2014, Trimmomatic: a flexible trimmer for Illumina sequence data, Bioinformatics, 30, 2114, 10.1093\u002Fbioinformatics\u002Fbtu170",{"doi":1710},"10.1093\u002Fbioinformatics\u002Fbtu170",{"id":28,"text":1712,"url":28,"identifiers":1713},"Brad Chapman\n        R.K.\n       et al. (2018) Validated, Scalable, Community Developed Variant Calling, RNA-Seq and Small RNA Analysis, https:\u002F\u002Fgithub.com\u002Fchapmanb\u002Fbcbio-nextgen.",{},{"id":28,"text":1715,"url":28,"identifiers":1716},"Chen, 2017, AfterQC: automatic filtering, trimming, error removing and quality control for fastq data, BMC Bioinformatics, 18, 80, 10.1186\u002Fs12859-017-1469-3",{"doi":1717},"10.1186\u002Fs12859-017-1469-3",{"id":28,"text":1719,"url":28,"identifiers":1720},"Chen, 2018, SOAPnuke: a MapReduce acceleration-supported software for integrated quality control and preprocessing of high-throughput sequencing data, Gigascience, 7, 1, 10.1093\u002Fgigascience\u002Fgix120",{"doi":1721},"10.1093\u002Fgigascience\u002Fgix120",{"id":28,"text":1723,"url":28,"identifiers":1724},"Chiang, 2015, SpeedSeq: ultra-fast personal genome analysis and interpretation, Nat. Methods, 12, 966, 10.1038\u002Fnmeth.3505",{"doi":1725},"10.1038\u002Fnmeth.3505",{"id":28,"text":1727,"url":28,"identifiers":1728},"Esposito, 2017, The emerging role of “Liquid Biopsies,” circulating tumor cells, and circulating cell-free tumor dna in lung cancer diagnosis and identification of resistance mutations, Curr. Oncol. Rep., 19, 10.1007\u002Fs11912-017-0564-y",{"doi":1729},"10.1007\u002Fs11912-017-0564-y",{"id":28,"text":1731,"url":28,"identifiers":1732},"Kennedy, 2014, Detecting ultralow-frequency mutations by duplex sequencing, Nat. Protoc., 9, 2586, 10.1038\u002Fnprot.2014.170",{"doi":1733},"10.1038\u002Fnprot.2014.170",{"id":28,"text":1735,"url":28,"identifiers":1736},"Langmead, 2012, Fast gapped-read alignment with Bowtie 2, Nat. Methods, 9, 357, 10.1038\u002Fnmeth.1923",{"doi":1737},"10.1038\u002Fnmeth.1923",{"id":28,"text":1739,"url":28,"identifiers":1740},"Li, 2009, Fast and accurate short read alignment with Burrows-Wheeler transform, Bioinformatics, 25, 1754, 10.1093\u002Fbioinformatics\u002Fbtp324",{"doi":1133},{"id":28,"text":1742,"url":28,"identifiers":1743},"Li, 2009, The Sequence Alignment\u002FMap format and SAMtools, Bioinformatics, 25, 2078, 10.1093\u002Fbioinformatics\u002Fbtp352",{"doi":1137},{"id":28,"text":1745,"url":28,"identifiers":1746},"Martin, 2011, Cutadapt removes adapter sequences from high-throughput sequencing reads, EMBnet J., 17, 10, 10.14806\u002Fej.17.1.200",{"doi":1747},"10.14806\u002Fej.17.1.200",{"id":28,"text":1749,"url":28,"identifiers":1750},"Newman, 2016, Integrated digital error suppression for improved detection of circulating tumor DNA, Nat. Biotechnol., 34, 547, 10.1038\u002Fnbt.3520",{"doi":1751},"10.1038\u002Fnbt.3520",{"id":28,"text":1753,"url":28,"identifiers":1754},"Smith, 2017, UMI-tools: modelling sequencing errors in Unique Molecular Identifiers to improve quantification accuracy, Genome Res., 27, 491, 10.1101\u002Fgr.209601.116",{"doi":1755},"10.1101\u002Fgr.209601.116",{"id":28,"text":1757,"url":28,"identifiers":1758},"Valentine Svensson\n        R.K.\n       et al. (2018) Tools for Processing UMI RNA-Tag Data, https:\u002F\u002Fgithub.com\u002Fvals\u002Fumis.",{},{"id":1760,"createTime":1761,"updateTime":1762,"relativeEntities":1763,"slug":1764,"properties":1765,"entityType":906,"verifyStatus":26,"verifyTime":1783,"verifyNote":961,"languages":1784,"translateLanguages":1785,"viewCount":32,"primaryUrl":1786,"fullTextUrl":28,"authors":1787,"publicationType":911,"publisherRelationship":1824,"citationCount":1845,"citationInfo":1846,"publishDate":1860,"publishYear":1508,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1861,"openAccess":28,"references":1862,"isForceReanalyzing":938},"28d556f0-63cf-48ca-8afd-d7b763c01dfb","2024-10-07T11:15:41.298+00:00","2025-01-05T13:12:41.406+00:00",[],"GenAlEx-6-5-genetic-analysis-in-Excel-Population-genetic-software-for-teaching-and-research-an-update",{"mag":1766,"keywords":1768,"pmc":1769,"openalex":1771,"abstract":1773,"title":1776,"pm":1779,"doi":1781},{"VOID":1767},"2127396309",{"VI":931},{"VOID":1770},"3463245",{"VOID":1772},"W2127396309",{"VI":1774,"EN":1775},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:p>Tóm tắt: GenAlEx: Phân tích di truyền trong Excel là một gói phần mềm đa nền tảng cho các phân tích di truyền quần thể chạy trong Microsoft Excel. GenAlEx cung cấp phân tích các loci gen diploid đồng trội, haploid và nhị phân cùng với các chuỗi DNA. Cả phân tích dựa trên tần suất (F-statistics, độ đa dạng dị hợp tử, HWE, phân loại quần thể, mối quan hệ) và phân tích dựa trên khoảng cách (AMOVA, PCoA, kiểm định Mantel, phân tích tự tương quan không gian đa biến) đều được cung cấp. Các tính năng mới bao gồm tính toán các ước lượng mới về cấu trúc quần thể: G′ST, G′′ST, Jost’s Dest và F′ST qua AMOVA, phân tích thông tin Shannon, phân tích sự cân bằng liên kết cho dữ liệu biallelic và các kiểm định không đồng nhất mới cho phân tích tự tương quan không gian. Hỗ trợ xuất ra hơn 30 định dạng dữ liệu khác nhau. Các bài giảng giảng dạy và tùy chọn xuất kết quả mở rộng từng bước cũng được bao gồm. Hướng dẫn toàn diện đã được sửa đổi hoàn toàn.\u003C\u002Fjats:p>\n               \u003Cjats:p>Sự sẵn có và triển khai: GenAlEx được viết bằng VBA và được cung cấp dưới dạng tiện ích bổ sung cho Microsoft Excel (tương thích với Excel 2003, 2007, 2010 trên PC; Excel 2004, 2011 trên Macintosh). GenAlEx, tài liệu hỗ trợ và các bài giảng giảng dạy có sẵn miễn phí tại: http:\u002F\u002Fbiology.anu.edu.au\u002FGenAlEx.\u003C\u002Fjats:p>\n               \u003Cjats:p>Liên hệ: rod.peakall@anu.edu.au\u003C\u002Fjats:p>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Summary: GenAlEx: Genetic Analysis in Excel is a cross-platform package for population genetic analyses that runs within Microsoft Excel. GenAlEx offers analysis of diploid codominant, haploid and binary genetic loci and DNA sequences. Both frequency-based (F-statistics, heterozygosity, HWE, population assignment, relatedness) and distance-based (AMOVA, PCoA, Mantel tests, multivariate spatial autocorrelation) analyses are provided. New features include calculation of new estimators of population structure: G′ST, G′′ST, Jost’s Dest and F′ST through AMOVA, Shannon Information analysis, linkage disequilibrium analysis for biallelic data and novel heterogeneity tests for spatial autocorrelation analysis. Export to more than 30 other data formats is provided. Teaching tutorials and expanded step-by-step output options are included. The comprehensive guide has been fully revised.\u003C\u002Fjats:p>\n               \u003Cjats:p>Availability and implementation: GenAlEx is written in VBA and provided as a Microsoft Excel Add-in (compatible with Excel 2003, 2007, 2010 on PC; Excel 2004, 2011 on Macintosh). GenAlEx, and supporting documentation and tutorials are freely available at: http:\u002F\u002Fbiology.anu.edu.au\u002FGenAlEx.\u003C\u002Fjats:p>\n               \u003Cjats:p>Contact:  rod.peakall@anu.edu.au\u003C\u002Fjats:p>",{"EN":1777,"VI":1778},"GenAlEx 6.5: genetic analysis in Excel. Population genetic software for teaching and research—an update","GenAlEx 6.5: phân tích gen trong Excel. Phần mềm di truyền quần thể cho giảng dạy và nghiên cứu - một bản cập nhật",{"VOID":1780},"22820204",{"VOID":1782},"10.1093\u002Fbioinformatics\u002Fbts460","2024-10-07T11:15:41.297+00:00",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F28\u002F19\u002F2537\u002F288671",[1788,1807],{"id":1789,"sortIndex":32,"researcher":28,"roles":1790,"affiliations":1791,"properties":1800,"displayName":1804,"givenName":28,"familyName":28},"80e4c339-c9e7-402d-9864-1792e8d933e6",[],[1792],{"id":1793,"sortIndex":32,"affiliation":1794,"properties":28},"5090c6c9-b345-4027-b15c-742f7384b272",{"id":1793,"createTime":28,"updateTime":28,"relativeEntities":1795,"slug":28,"properties":1796,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1799,"statistic":28},[],{"title":1797},{"EN":1798},"1 Evolution, Ecology and Genetics, Research School of Biology, The Australian National University, Canberra ACT 0200, Australia and 2Department of Ecology, Evolution and Natural Resources, School of Environmental and Biological Sciences, Rutgers University, New Brunswick, NJ 08901-8551, USA",[],{"orcid":1801,"title":1803,"openalex":1805},{"VOID":1802},"https:\u002F\u002Forcid.org\u002F0000-0001-9407-8404",{"EN":1804},"Rod Peakall",{"VOID":1806},"A5073802325",{"id":1808,"sortIndex":40,"researcher":28,"roles":1809,"affiliations":1810,"properties":1817,"displayName":1821,"givenName":28,"familyName":28},"d50a995d-8401-45e2-b3a4-70510cfbb66c",[],[1811],{"id":1793,"sortIndex":32,"affiliation":1812,"properties":28},{"id":1793,"createTime":28,"updateTime":28,"relativeEntities":1813,"slug":28,"properties":1814,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1816,"statistic":28},[],{"title":1815},{"EN":1798},[],{"orcid":1818,"title":1820,"openalex":1822},{"VOID":1819},"https:\u002F\u002Forcid.org\u002F0000-0003-4474-3458",{"EN":1821},"Peter E. Smouse",{"VOID":1823},"A5102836099",{"url":28,"publisher":1825,"properties":1839},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1826,"slug":872,"properties":1827,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1830,"manageAffiliations":1831,"indexDatabases":1832,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1828,"title":1829},{"VOID":875},{"VOID":877},[],[],[1833],{"id":883,"indexDatabase":1834,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1835,"label":1836,"description":1837,"key":781,"publicationTags":1838,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":1840,"pages":1842,"volume":1844},{"VOID":1841},"19",{"VOID":1843},"2537-2539",{"VOID":1505},11561,{"total":1845,"publishYear":1508,"statisticByYear":1847},{"2012":324,"2013":1848,"2014":1849,"2015":1850,"2016":1851,"2017":1852,"2018":1853,"2019":1854,"2020":1855,"2021":1856,"2022":1857,"2023":1858,"2024":1859},283,670,853,1043,1013,1083,1134,1279,1251,1048,1052,611,"2012-10-01",[891],[1863,1867,1870,1874,1877,1881,1885,1888,1892,1896,1900,1904,1907,1911,1915,1919,1923,1927,1931,1935,1939,1943,1946],{"id":28,"text":1864,"url":28,"identifiers":1865},"Banks, 2012, Genetic spatial autocorrelation can readily detect sex-biased dispersal, Mol. Ecol., 21, 2092, 10.1111\u002Fj.1365-294X.2012.05485.x",{"doi":1866},"10.1111\u002Fj.1365-294X.2012.05485.x",{"id":28,"text":1868,"url":28,"identifiers":1869},"Double, 2005, Dispersal, philopatry and infidelity: dissecting local genetic structure in superb fairy-wrens (Malurus cyaneus), Evolution, 59, 625",{},{"id":28,"text":1871,"url":28,"identifiers":1872},"Excoffier, 2010, Arlequin suite ver 3.5: a new series of programs to perform population genetics analyses under Linux and Windows, Mol. Ecol. Res., 10, 564, 10.1111\u002Fj.1755-0998.2010.02847.x",{"doi":1873},"10.1111\u002Fj.1755-0998.2010.02847.x",{"id":28,"text":1875,"url":28,"identifiers":1876},"Hedrick, 2005, Genetics of Populations, 3rd",{},{"id":28,"text":1878,"url":28,"identifiers":1879},"Jost, 2008, G\n             ST and its relatives do not measure differentiation, Mol. Ecol., 17, 4015, 10.1111\u002Fj.1365-294X.2008.03887.x",{"doi":1880},"10.1111\u002Fj.1365-294X.2008.03887.x",{"id":28,"text":1882,"url":28,"identifiers":1883},"Jombart, 2008, adegenet: a R package for the multivariate analysis of genetic markers, Bioinformatics, 24, 1403, 10.1093\u002Fbioinformatics\u002Fbtn129",{"doi":1884},"10.1093\u002Fbioinformatics\u002Fbtn129",{"id":28,"text":1886,"url":28,"identifiers":1887},"Lewis\n              PO\n            \n             ZaykinD\n          Genetic Data Analysis V1.1.\n          2001\n          Available at http:\u002F\u002Fwww.eeb.uconn.edu\u002Fpeople\u002Fplewis\u002Fsoftware.php (30 May 2012, date last accessed)",{},{"id":28,"text":1889,"url":28,"identifiers":1890},"Meirmans, 2006, Using the AMOVA framework to estimate a standardized genetic differentiation measure, Evolution, 60, 2399, 10.1111\u002Fj.0014-3820.2006.tb01874.x",{"doi":1891},"10.1111\u002Fj.0014-3820.2006.tb01874.x",{"id":28,"text":1893,"url":28,"identifiers":1894},"Meirmans, 2011, Assessing population structure: FST and related measures, Mol. Ecol. Res., 11, 5, 10.1111\u002Fj.1755-0998.2010.02927.x",{"doi":1895},"10.1111\u002Fj.1755-0998.2010.02927.x",{"id":28,"text":1897,"url":28,"identifiers":1898},"Meirmans, 2004, GENOTYPE and GENODIVE: two programs for the analysis of genetic diversity of asexual organisms, Mol. Ecol. Notes, 4, 792, 10.1111\u002Fj.1471-8286.2004.00770.x",{"doi":1899},"10.1111\u002Fj.1471-8286.2004.00770.x",{"id":28,"text":1901,"url":28,"identifiers":1902},"Paradis, 2010, pegas: an R package for population genetics with an integrated-modular approach, Bioinformatics, 26, 419, 10.1093\u002Fbioinformatics\u002Fbtp696",{"doi":1903},"10.1093\u002Fbioinformatics\u002Fbtp696",{"id":28,"text":1905,"url":28,"identifiers":1906},"Peakall, 2003, Spatial autocorrelation analysis offers new insights into gene flow in the Australian bush rat, Rattus fuscipes, Evolution, 57, 1182",{},{"id":28,"text":1908,"url":28,"identifiers":1909},"Peakall, 2006, GenAlEx 6: genetic analysis in Excel. Population genetic software for teaching and research, Mol. Ecol. Notes, 6, 288, 10.1111\u002Fj.1471-8286.2005.01155.x",{"doi":1910},"10.1111\u002Fj.1471-8286.2005.01155.x",{"id":28,"text":1912,"url":28,"identifiers":1913},"Pritchard, 2000, Inference of population structure using multilocus genotype data, Genetics, 155, 945, 10.1093\u002Fgenetics\u002F155.2.945",{"doi":1914},"10.1093\u002Fgenetics\u002F155.2.945",{"id":28,"text":1916,"url":28,"identifiers":1917},"Rousset, 2008, GENEPOP’007: a complete re-implementation of the genepop software for Windows and Linux, Mol. Ecol. Res., 8, 103, 10.1111\u002Fj.1471-8286.2007.01931.x",{"doi":1918},"10.1111\u002Fj.1471-8286.2007.01931.x",{"id":28,"text":1920,"url":28,"identifiers":1921},"Ryman, 2009, GST is still a useful measure of genetic differentiation—a comment on Jost's D, Mol. Ecol., 18, 2084, 10.1111\u002Fj.1365-294X.2009.04187.x",{"doi":1922},"10.1111\u002Fj.1365-294X.2009.04187.x",{"id":28,"text":1924,"url":28,"identifiers":1925},"Sherwin, 2006, Measurement of biological information with applications from genes to landscapes, Mol. Ecol., 15, 2857, 10.1111\u002Fj.1365-294X.2006.02992.x",{"doi":1926},"10.1111\u002Fj.1365-294X.2006.02992.x",{"id":28,"text":1928,"url":28,"identifiers":1929},"Slatkin, 2008, Linkage disequilibrium—understanding the evolutionary past and mapping the medical future, Nat. Rev. Genet., 9, 477, 10.1038\u002Fnrg2361",{"doi":1930},"10.1038\u002Fnrg2361",{"id":28,"text":1932,"url":28,"identifiers":1933},"Smouse, 1999, Spatial autocorrelation analysis of individual multiallele and multilocus genetic structure, Heredity, 82, 561, 10.1038\u002Fsj.hdy.6885180",{"doi":1934},"10.1038\u002Fsj.hdy.6885180",{"id":28,"text":1936,"url":28,"identifiers":1937},"Smouse, 1978, A comparison of the genetic infrastructure of the Ye'cuana and Yanomama: a likelihood analysis of genotypic variation among populations, Genetics, 88, 611, 10.1093\u002Fgenetics\u002F88.3.611",{"doi":1938},"10.1093\u002Fgenetics\u002F88.3.611",{"id":28,"text":1940,"url":28,"identifiers":1941},"Smouse, 2008, A heterogeneity test for fine-scale genetic structure, Mol. Ecol., 17, 3389, 10.1111\u002Fj.1365-294X.2008.03839.x",{"doi":1942},"10.1111\u002Fj.1365-294X.2008.03839.x",{"id":28,"text":1944,"url":28,"identifiers":1945},"Weir, 1990, Genetic Data Analysis",{},{"id":28,"text":1947,"url":28,"identifiers":1948},"Whitlock, 2011, G'ST and D do not replace FST, Mol. Ecol., 20, 1083, 10.1111\u002Fj.1365-294X.2010.04996.x",{"doi":1949},"10.1111\u002Fj.1365-294X.2010.04996.x",{"id":1951,"createTime":1952,"updateTime":1953,"relativeEntities":1954,"slug":1955,"properties":1956,"entityType":906,"verifyStatus":878,"verifyTime":1952,"verifyNote":1972,"languages":1973,"translateLanguages":1974,"viewCount":32,"primaryUrl":1975,"fullTextUrl":28,"authors":1976,"publicationType":911,"publisherRelationship":2018,"citationCount":2039,"citationInfo":2040,"publishDate":2056,"publishYear":2041,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2057,"openAccess":28,"references":2058,"isForceReanalyzing":938},"d6c84c20-10a0-43eb-8cde-272b10fc48c1","2024-09-24T21:08:28.034+00:00","2025-01-05T13:13:37.269+00:00",[],"APE-Analyses-of-Phylogenetics-and-Evolution-in-R-language",{"mag":1957,"keywords":1959,"openalex":1960,"abstract":1962,"title":1965,"pm":1968,"doi":1970},{"VOID":1958},"2151409320",{"VI":931},{"VOID":1961},"W2151409320",{"VI":1963,"EN":1964},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:p>Tóm lược: Phân tích Phylogenetics và Tiến hóa (APE) là một gói phần mềm được viết bằng ngôn ngữ R, phục vụ cho việc nghiên cứu tiến hóa phân tử và phylogenetics. APE cung cấp cả các hàm tiện ích để đọc và ghi dữ liệu, cũng như thao tác với các cây phát sinh chủng loài, và cũng nhiều phương pháp nâng cao cho phân tích phylogenetics và tiến hóa (ví dụ: các phương pháp di truyền so sánh và dân số). APE tận dụng nhiều hàm R cho thống kê và đồ họa, và cũng cung cấp một khung linh hoạt để phát triển và thực hiện thêm các phương pháp thống kê cho phân tích các quá trình tiến hóa.\u003C\u002Fjats:p>\n               \u003Cjats:p>Sự có sẵn: Chương trình này miễn phí và có sẵn từ kho gói chính thức của R tại http:\u002F\u002Fcran.r-project.org\u002Fsrc\u002Fcontrib\u002FPACKAGES.html#ape. APE được cấp phép theo Giấy phép Công cộng GNU.\u003C\u002Fjats:p>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Summary: Analysis of Phylogenetics and Evolution (APE) is a package written in the R language for use in molecular evolution and phylogenetics. APE provides both utility functions for reading and writing data and manipulating phylogenetic trees, as well as several advanced methods for phylogenetic and evolutionary analysis (e.g. comparative and population genetic methods). APE takes advantage of the many R functions for statistics and graphics, and also provides a flexible framework for developing and implementing further statistical methods for the analysis of evolutionary processes.\u003C\u002Fjats:p>\n               \u003Cjats:p>Availability: The program is free and available from the official R package archive at http:\u002F\u002Fcran.r-project.org\u002Fsrc\u002Fcontrib\u002FPACKAGES.html#ape. APE is licensed under the GNU General Public License.\u003C\u002Fjats:p>",{"EN":1966,"VI":1967},"APE: Analyses of Phylogenetics and Evolution in R language","APE: Phân tích Phylogenetics và Tiến hóa bằng ngôn ngữ R",{"VOID":1969},"14734327",{"VOID":1971},"10.1093\u002Fbioinformatics\u002Fbtg412","Author affiliation is blank",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F20\u002F2\u002F289\u002F204981",[1977,1996,2007],{"id":1978,"sortIndex":32,"researcher":28,"roles":1979,"affiliations":1980,"properties":1989,"displayName":1993,"givenName":28,"familyName":28},"edd6f60b-54e8-497e-ac7a-2df28e8beff8",[],[1981],{"id":1982,"sortIndex":32,"affiliation":1983,"properties":28},"9a958c78-c5cf-48e6-976c-80d14c6940a4",{"id":1982,"createTime":28,"updateTime":28,"relativeEntities":1984,"slug":28,"properties":1985,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1988,"statistic":28},[],{"title":1986},{"EN":1987},"Laboratoire de Paléontologie, Paléobiologie and Phylogénie, Institut des Sciences de l'Evolution, Université Montpellier II, F-34095 Montpellier cédex 05, France. paradis@isem.univ-montp2.fr",[],{"orcid":1990,"title":1992,"openalex":1994},{"VOID":1991},"https:\u002F\u002Forcid.org\u002F0000-0003-3092-2199",{"EN":1993},"Emmanuel Paradis",{"VOID":1995},"A5091069787",{"id":1997,"sortIndex":40,"researcher":28,"roles":1998,"affiliations":1999,"properties":2000,"displayName":2004,"givenName":28,"familyName":28},"a657daf3-f73e-4c29-be13-8f36d99c9f8e",[],[],{"orcid":2001,"title":2003,"openalex":2005},{"VOID":2002},"https:\u002F\u002Forcid.org\u002F0000-0002-9267-1228",{"EN":2004},"Julien Claude",{"VOID":2006},"A5050859223",{"id":2008,"sortIndex":123,"researcher":28,"roles":2009,"affiliations":2010,"properties":2011,"displayName":2015,"givenName":28,"familyName":28},"f4b89700-c799-4c58-a437-cd9692292c8b",[],[],{"orcid":2012,"title":2014,"openalex":2016},{"VOID":2013},"https:\u002F\u002Forcid.org\u002F0000-0001-7917-2056",{"EN":2015},"Korbinian Strimmer",{"VOID":2017},"A5000442405",{"url":28,"publisher":2019,"properties":2033},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2020,"slug":872,"properties":2021,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2024,"manageAffiliations":2025,"indexDatabases":2026,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2022,"title":2023},{"VOID":875},{"VOID":877},[],[],[2027],{"id":883,"indexDatabase":2028,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2029,"label":2030,"description":2031,"key":781,"publicationTags":2032,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":2034,"pages":2036,"volume":2038},{"VOID":2035},"2",{"VOID":2037},"289-290",{"VOID":929},11310,{"total":2039,"publishYear":2041,"statisticByYear":2042},2004,{"2012":2043,"2013":2044,"2014":2045,"2015":2046,"2016":2047,"2017":2048,"2018":2049,"2019":2050,"2020":2051,"2021":2052,"2022":2053,"2023":2054,"2024":2055},361,460,642,795,935,1102,1377,1252,1061,850,717,615,373,"2004-01-22",[891],[],{"id":2060,"createTime":2061,"updateTime":2062,"relativeEntities":2063,"slug":2064,"properties":2065,"entityType":906,"verifyStatus":26,"verifyTime":2061,"verifyNote":961,"languages":2081,"translateLanguages":2082,"viewCount":32,"primaryUrl":2083,"fullTextUrl":28,"authors":2084,"publicationType":911,"publisherRelationship":2172,"citationCount":2193,"citationInfo":2194,"publishDate":2204,"publishYear":2195,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2205,"openAccess":28,"references":2206,"isForceReanalyzing":938},"132939d0-23ba-45f7-878d-74ca72d6dfb9","2024-10-06T15:22:52.823+00:00","2025-01-05T13:14:33.354+00:00",[],"BUSCO-assessing-genome-assembly-and-annotation-completeness-with-single-copy-orthologs",{"mag":2066,"keywords":2068,"openalex":2069,"abstract":2071,"title":2074,"pm":2077,"doi":2079},{"VOID":2067},"2155628349",{"VI":931},{"VOID":2070},"W2155628349",{"VI":2072,"EN":2073},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:p>Động lực: Genomics đã cách mạng hóa nghiên cứu sinh học, nhưng việc đánh giá chất lượng của các chuỗi lắp ráp kết quả thì phức tạp và chủ yếu bị giới hạn trong các biện pháp kỹ thuật như N50.\u003C\u002Fjats:p>\n               \u003Cjats:p>Kết quả: Chúng tôi đề xuất một biện pháp để đánh giá định lượng tính hoàn chỉnh của việc lắp ráp và chú thích gen dựa trên những kỳ vọng có thông tin từ tiến hóa về nội dung gen. Chúng tôi đã triển khai quy trình đánh giá trong phần mềm mã nguồn mở, với các bộ Benchmarking Universal Single-Copy Orthologs, gọi tắt là BUSCO.\u003C\u002Fjats:p>\n               \u003Cjats:p>Khả năng tiếp cận và triển khai: Phần mềm được triển khai bằng Python và các tập dữ liệu có thể tải về từ http:\u002F\u002Fbusco.ezlab.org.\u003C\u002Fjats:p>\n               \u003Cjats:p>Liên hệ: evgeny.zdobnov@unige.ch\u003C\u002Fjats:p>\n               \u003Cjats:p>Thông tin bổ sung: Dữ liệu bổ sung có sẵn tại Bioinformatics online.\u003C\u002Fjats:p>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Motivation: Genomics has revolutionized biological research, but quality assessment of the resulting assembled sequences is complicated and remains mostly limited to technical measures like N50.\u003C\u002Fjats:p>\n               \u003Cjats:p>Results: We propose a measure for quantitative assessment of genome assembly and annotation completeness based on evolutionarily informed expectations of gene content. We implemented the assessment procedure in open-source software, with sets of Benchmarking Universal Single-Copy Orthologs, named BUSCO.\u003C\u002Fjats:p>\n               \u003Cjats:p>Availability and implementation: Software implemented in Python and datasets available for download from http:\u002F\u002Fbusco.ezlab.org.\u003C\u002Fjats:p>\n               \u003Cjats:p>Contact:  evgeny.zdobnov@unige.ch\u003C\u002Fjats:p>\n               \u003Cjats:p>Supplementary information:  Supplementary data are available at Bioinformatics online.\u003C\u002Fjats:p>",{"EN":2075,"VI":2076},"BUSCO: assessing genome assembly and annotation completeness with single-copy orthologs","BUSCO: Đánh giá tính hoàn chỉnh của việc lắp ráp gen và chú thích bằng các ortholog đơn bản sao",{"VOID":2078},"26059717",{"VOID":2080},"10.1093\u002Fbioinformatics\u002Fbtv351",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F31\u002F19\u002F3210\u002F211866",[2085,2104,2121,2138,2155],{"id":2086,"sortIndex":32,"researcher":28,"roles":2087,"affiliations":2088,"properties":2097,"displayName":2101,"givenName":28,"familyName":28},"6ddd8e38-f390-45f8-a17a-08c556acb184",[],[2089],{"id":2090,"sortIndex":32,"affiliation":2091,"properties":28},"492f145a-4bd8-4f62-99b2-7cade209cbc1",{"id":2090,"createTime":28,"updateTime":28,"relativeEntities":2092,"slug":28,"properties":2093,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2096,"statistic":28},[],{"title":2094},{"EN":2095},"Department of Genetic Medicine and Development, University of Geneva Medical School and Swiss Institute of Bioinformatics, rue Michel-Servet 1, 1211 Geneva, Switzerland",[],{"orcid":2098,"title":2100,"openalex":2102},{"VOID":2099},"https:\u002F\u002Forcid.org\u002F0000-0002-0656-4080",{"EN":2101},"Felipe A. Simão",{"VOID":2103},"A5032877474",{"id":2105,"sortIndex":40,"researcher":28,"roles":2106,"affiliations":2107,"properties":2114,"displayName":2118,"givenName":28,"familyName":28},"3016dbdc-6647-4454-b868-085f5657c7a8",[],[2108],{"id":2090,"sortIndex":32,"affiliation":2109,"properties":28},{"id":2090,"createTime":28,"updateTime":28,"relativeEntities":2110,"slug":28,"properties":2111,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2113,"statistic":28},[],{"title":2112},{"EN":2095},[],{"orcid":2115,"title":2117,"openalex":2119},{"VOID":2116},"https:\u002F\u002Forcid.org\u002F0000-0003-4199-9052",{"EN":2118},"Robert M. Waterhouse",{"VOID":2120},"A5067477017",{"id":2122,"sortIndex":123,"researcher":28,"roles":2123,"affiliations":2124,"properties":2131,"displayName":2135,"givenName":28,"familyName":28},"d63e129c-c85e-4eec-bdcd-1b9d34888385",[],[2125],{"id":2090,"sortIndex":32,"affiliation":2126,"properties":28},{"id":2090,"createTime":28,"updateTime":28,"relativeEntities":2127,"slug":28,"properties":2128,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2130,"statistic":28},[],{"title":2129},{"EN":2095},[],{"orcid":2132,"title":2134,"openalex":2136},{"VOID":2133},"https:\u002F\u002Forcid.org\u002F0000-0003-0939-6745",{"EN":2135},"Panagiotis Ioannidis",{"VOID":2137},"A5089103645",{"id":2139,"sortIndex":42,"researcher":28,"roles":2140,"affiliations":2141,"properties":2148,"displayName":2152,"givenName":28,"familyName":28},"b25aa3d1-0d92-4887-a4ff-93ecccde82d6",[],[2142],{"id":2090,"sortIndex":32,"affiliation":2143,"properties":28},{"id":2090,"createTime":28,"updateTime":28,"relativeEntities":2144,"slug":28,"properties":2145,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2147,"statistic":28},[],{"title":2146},{"EN":2095},[],{"orcid":2149,"title":2151,"openalex":2153},{"VOID":2150},"https:\u002F\u002Forcid.org\u002F0000-0003-4835-7562",{"EN":2152},"Evgenia V. Kriventseva",{"VOID":2154},"A5038335924",{"id":2156,"sortIndex":45,"researcher":28,"roles":2157,"affiliations":2158,"properties":2165,"displayName":2169,"givenName":28,"familyName":28},"5a11d999-c7fa-4bdc-8c1a-c2400e3d73ef",[],[2159],{"id":2090,"sortIndex":32,"affiliation":2160,"properties":28},{"id":2090,"createTime":28,"updateTime":28,"relativeEntities":2161,"slug":28,"properties":2162,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2164,"statistic":28},[],{"title":2163},{"EN":2095},[],{"orcid":2166,"title":2168,"openalex":2170},{"VOID":2167},"https:\u002F\u002Forcid.org\u002F0000-0002-5178-1498",{"EN":2169},"Evgeny M. Zdobnov",{"VOID":2171},"A5029893038",{"url":28,"publisher":2173,"properties":2187},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2174,"slug":872,"properties":2175,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2178,"manageAffiliations":2179,"indexDatabases":2180,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2176,"title":2177},{"VOID":875},{"VOID":877},[],[],[2181],{"id":883,"indexDatabase":2182,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2183,"label":2184,"description":2185,"key":781,"publicationTags":2186,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":2188,"pages":2189,"volume":2191},{"VOID":1841},{"VOID":2190},"3210-3212",{"VOID":2192},"31",10668,{"total":2193,"publishYear":2195,"statisticByYear":2196},2015,{"2014":123,"2015":134,"2016":520,"2017":2197,"2018":2198,"2019":2199,"2020":2200,"2021":1518,"2022":2201,"2023":2202,"2024":2203},518,854,1188,1498,1541,1814,1392,"2015-10-01",[891],[2207,2211,2215,2219,2223,2227,2231,2235,2239,2243,2247],{"id":28,"text":2208,"url":28,"identifiers":2209},"Clark, 2013, ALE: a generic assembly likelihood evaluation framework for assessing the accuracy of genome and metagenome assemblies, Bioinformatics, 29, 435, 10.1093\u002Fbioinformatics\u002Fbts723",{"doi":2210},"10.1093\u002Fbioinformatics\u002Fbts723",{"id":28,"text":2212,"url":28,"identifiers":2213},"Eddy, 2011, Accelerated profile HMM searches, PLoS Comput. Biol., 7, e1002195, 10.1371\u002Fjournal.pcbi.1002195",{"doi":2214},"10.1371\u002Fjournal.pcbi.1002195",{"id":28,"text":2216,"url":28,"identifiers":2217},"Gurevich, 2013, QUAST: quality assessment tool for genome assemblies, Bioinformatics, 29, 1072, 10.1093\u002Fbioinformatics\u002Fbtt086",{"doi":2218},"10.1093\u002Fbioinformatics\u002Fbtt086",{"id":28,"text":2220,"url":28,"identifiers":2221},"Hunt, 2013, REAPR: a universal tool for genome assembly evaluation, Genome Biol., 14, R47, 10.1186\u002Fgb-2013-14-5-r47",{"doi":2222},"10.1186\u002Fgb-2013-14-5-r47",{"id":28,"text":2224,"url":28,"identifiers":2225},"Keller, 2011, A novel hybrid gene prediction method employing protein multiple sequence alignments, Bioinformatics, 27, 757, 10.1093\u002Fbioinformatics\u002Fbtr010",{"doi":2226},"10.1093\u002Fbioinformatics\u002Fbtr010",{"id":28,"text":2228,"url":28,"identifiers":2229},"Mende, 2013, Accurate and universal delineation of prokaryotic species, Nat. Methods, 10, 881, 10.1038\u002Fnmeth.2575",{"doi":2230},"10.1038\u002Fnmeth.2575",{"id":28,"text":2232,"url":28,"identifiers":2233},"Parra, 2007, CEGMA: a pipeline to accurately annotate core genes in eukaryotic genomes, Bioinformatics, 23, 1061, 10.1093\u002Fbioinformatics\u002Fbtm071",{"doi":2234},"10.1093\u002Fbioinformatics\u002Fbtm071",{"id":28,"text":2236,"url":28,"identifiers":2237},"Parra, 2009, Assessing the gene space in draft genomes, Nucleic Acids Res., 37, 289, 10.1093\u002Fnar\u002Fgkn916",{"doi":2238},"10.1093\u002Fnar\u002Fgkn916",{"id":28,"text":2240,"url":28,"identifiers":2241},"Simpson, 2014, Exploring genome characteristics and sequence quality without a reference, Bioinformatics, 30, 1228, 10.1093\u002Fbioinformatics\u002Fbtu023",{"doi":2242},"10.1093\u002Fbioinformatics\u002Fbtu023",{"id":28,"text":2244,"url":28,"identifiers":2245},"Waterhouse, 2011, Correlating traits of gene retention, sequence divergence, duplicability and essentiality, Genome Biol. Evol., 3, 75, 10.1093\u002Fgbe\u002Fevq083",{"doi":2246},"10.1093\u002Fgbe\u002Fevq083",{"id":28,"text":2248,"url":28,"identifiers":2249},"Waterhouse, 2013, OrthoDB: a hierarchical catalog of animal, fungal and bacterial orthologs, Nucleic Acids Res., 41, D358, 10.1093\u002Fnar\u002Fgks1116",{"doi":2250},"10.1093\u002Fnar\u002Fgks1116",{"id":2252,"createTime":2253,"updateTime":2254,"relativeEntities":2255,"slug":2256,"properties":2257,"entityType":906,"verifyStatus":26,"verifyTime":2253,"verifyNote":961,"languages":2273,"translateLanguages":2274,"viewCount":32,"primaryUrl":2275,"fullTextUrl":28,"authors":2276,"publicationType":911,"publisherRelationship":2357,"citationCount":2379,"citationInfo":2380,"publishDate":2396,"publishYear":2381,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2397,"openAccess":28,"references":2398,"isForceReanalyzing":938},"7c7ae9f5-c123-46cc-b19e-f10afe33123a","2024-09-26T16:44:49.205+00:00","2025-01-05T13:15:29.128+00:00",[],"Blast2GO-a-universal-tool-for-annotation-visualization-and-analysis-in-functional-genomics-research",{"mag":2258,"keywords":2260,"openalex":2261,"abstract":2263,"title":2266,"pm":2269,"doi":2271},{"VOID":2259},"2164154943",{"VI":931},{"VOID":2262},"W2164154943",{"VI":2264,"EN":2265},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\u003Cjats:p>Tóm tắt: Chúng tôi trình bày Blast2GO (B2G), một công cụ nghiên cứu được thiết kế với mục đích chính là cho phép khai thác dữ liệu dựa trên Gene Ontology (GO) trên dữ liệu chuỗi mà chưa có chú thích GO. B2G kết hợp trong một ứng dụng chú thích GO dựa trên tìm kiếm có độ tương đồng với phân tích thống kê và trực quan hóa nổi bật trên các đồ thị có hướng acyclic. Công cụ này cung cấp một nền tảng phù hợp cho nghiên cứu gen chức năng ở các loài không phải mô hình. B2G là một ứng dụng máy tính để bàn trực quan và tương tác, cho phép theo dõi và hiểu toàn bộ quá trình chú thích và phân tích.\u003C\u002Fjats:p>\u003Cjats:p>Tính khả dụng: Blast2GO có sẵn miễn phí qua Java Web Start tại http:\u002F\u002Fwww.blast2go.de\u003C\u002Fjats:p>\u003Cjats:p>Tài liệu bổ sung: http:\u002F\u002Fwww.blast2go.de -> Đánh giá\u003C\u002Fjats:p>\u003Cjats:p>Liên hệ: aconesa@ivia.es; stefang@fis.upv.es\u003C\u002Fjats:p>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\u003Cjats:p>Summary: We present here Blast2GO (B2G), a research tool designed with the main purpose of enabling Gene Ontology (GO) based data mining on sequence data for which no GO annotation is yet available. B2G joints in one application GO annotation based on similarity searches with statistical analysis and highlighted visualization on directed acyclic graphs. This tool offers a suitable platform for functional genomics research in non-model species. B2G is an intuitive and interactive desktop application that allows monitoring and comprehension of the whole annotation and analysis process.\u003C\u002Fjats:p>\u003Cjats:p>Availability: Blast2GO is freely available via Java Web Start at http:\u002F\u002Fwww.blast2go.de\u003C\u002Fjats:p>\u003Cjats:p>Supplementary material:  http:\u002F\u002Fwww.blast2go.de -> Evaluation\u003C\u002Fjats:p>\u003Cjats:p>Contact:  aconesa@ivia.es; stefang@fis.upv.es\u003C\u002Fjats:p>",{"EN":2267,"VI":2268},"Blast2GO: a universal tool for annotation, visualization and analysis in functional genomics research","Blast2GO: công cụ đa năng cho chú thích, trực quan hóa và phân tích trong nghiên cứu gen chức năng",{"VOID":2270},"16081474",{"VOID":2272},"10.1093\u002Fbioinformatics\u002Fbti610",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F21\u002F18\u002F3674\u002F202517",[2277,2296,2323,2340],{"id":2278,"sortIndex":32,"researcher":28,"roles":2279,"affiliations":2280,"properties":2289,"displayName":2293,"givenName":28,"familyName":28},"003b3120-0b8d-4b23-b996-8186f9c55728",[],[2281],{"id":2282,"sortIndex":32,"affiliation":2283,"properties":28},"3fa64c11-bd72-43a4-a872-5c2c2e14296e",{"id":2282,"createTime":28,"updateTime":28,"relativeEntities":2284,"slug":28,"properties":2285,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2288,"statistic":28},[],{"title":2286},{"EN":2287},"Alfred-Wegener-Institut, Helmholtz-Zentrum für Polar- und Meeresforschung = Alfred Wegener Institute for Polar and Marine Research = Institut Alfred-Wegener pour la recherche polaire et marine",[],{"orcid":2290,"title":2292,"openalex":2294},{"VOID":2291},"https:\u002F\u002Forcid.org\u002F0000-0001-9597-311X",{"EN":2293},"Ana Conesa",{"VOID":2295},"A5002377126",{"id":2297,"sortIndex":40,"researcher":28,"roles":2298,"affiliations":2299,"properties":2316,"displayName":2320,"givenName":28,"familyName":28},"2c09faa0-c758-4562-8d87-8e22ba476104",[],[2300,2308],{"id":2301,"sortIndex":32,"affiliation":2302,"properties":28},"752d2947-2c78-45df-b501-6da192725252",{"id":2301,"createTime":28,"updateTime":28,"relativeEntities":2303,"slug":28,"properties":2304,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2307,"statistic":28},[],{"title":2305},{"EN":2306},"Evolutionary Biology and Ecology of Algae",[],{"id":2309,"sortIndex":40,"affiliation":2310,"properties":28},"03b91216-4389-4e63-b393-697711cec25f",{"id":2309,"createTime":28,"updateTime":28,"relativeEntities":2311,"slug":28,"properties":2312,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2315,"statistic":28},[],{"title":2313},{"EN":2314},"Pontificia Universidad Católica de Chile",[],{"orcid":2317,"title":2319,"openalex":2321},{"VOID":2318},"https:\u002F\u002Forcid.org\u002F0000-0001-5777-3520",{"EN":2320},"Stefan Götz",{"VOID":2322},"A5101526928",{"id":2324,"sortIndex":123,"researcher":28,"roles":2325,"affiliations":2326,"properties":2333,"displayName":2337,"givenName":28,"familyName":28},"be4209c2-b4e7-489c-8725-256432dfdf42",[],[2327],{"id":2282,"sortIndex":32,"affiliation":2328,"properties":28},{"id":2282,"createTime":28,"updateTime":28,"relativeEntities":2329,"slug":28,"properties":2330,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2332,"statistic":28},[],{"title":2331},{"EN":2287},[],{"orcid":2334,"title":2336,"openalex":2338},{"VOID":2335},"https:\u002F\u002Forcid.org\u002F0000-0002-3851-1557",{"EN":2337},"Juan M. García–Gómez",{"VOID":2339},"A5026025555",{"id":2341,"sortIndex":42,"researcher":28,"roles":2342,"affiliations":2343,"properties":2350,"displayName":2354,"givenName":28,"familyName":28},"cc19ca94-431c-488e-b110-c03368a06d66",[],[2344],{"id":2282,"sortIndex":32,"affiliation":2345,"properties":28},{"id":2282,"createTime":28,"updateTime":28,"relativeEntities":2346,"slug":28,"properties":2347,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2349,"statistic":28},[],{"title":2348},{"EN":2287},[],{"orcid":2351,"title":2353,"openalex":2355},{"VOID":2352},"https:\u002F\u002Forcid.org\u002F0000-0003-3345-0078",{"EN":2354},"Javier Terol",{"VOID":2356},"A5018975279",{"url":28,"publisher":2358,"properties":2372},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2359,"slug":872,"properties":2360,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2363,"manageAffiliations":2364,"indexDatabases":2365,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2361,"title":2362},{"VOID":875},{"VOID":877},[],[],[2366],{"id":883,"indexDatabase":2367,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2368,"label":2369,"description":2370,"key":781,"publicationTags":2371,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":2373,"pages":2375,"volume":2377},{"VOID":2374},"18",{"VOID":2376},"3674-3676",{"VOID":2378},"21",10655,{"total":2379,"publishYear":2381,"statisticByYear":2382},2005,{"2012":2383,"2013":2384,"2014":2385,"2015":2386,"2016":2387,"2017":2388,"2018":2389,"2019":2390,"2020":2391,"2021":2392,"2022":2393,"2023":2394,"2024":2395},415,592,772,869,971,933,988,1006,980,855,725,548,312,"2005-09-15",[891],[2399,2403,2406,2409,2412,2416,2420,2423,2426],{"id":28,"text":2400,"url":28,"identifiers":2401},"Al-Shahrour, F., et al. 2004FatiGO: a web tool for finding significant associations of Gene Ontology terms with groups of genes. Bioinformatics20578–580",{"doi":2402},"10.1093\u002Fbioinformatics\u002Fbtg455",{"id":28,"text":2404,"url":28,"identifiers":2405},"Altschul, S.F., et al. 1990Basic local alignment search tool. J. Mol. Biol.215403–410",{},{"id":28,"text":2407,"url":28,"identifiers":2408},"Ashburner, M., et al. 2000Gene Ontology: tool for the unification of biology. Nat. Genet.2525–29",{},{"id":28,"text":2410,"url":28,"identifiers":2411},"Blüthgen, N., Brand, K., Cajavec, B., Swat, M., Herzel, H., Beule, D. 2004Biological Profiling of Gene Groups utilizing Gene Ontology – A Statistical Framework. arXiv:q-bio.GN\u002F040703411",{},{"id":28,"text":2413,"url":28,"identifiers":2414},"Doniger, S., et al. 2003MAPPFinder: using Gene Ontology and GenMAPP to create a global gene-expression profile from microarray data. Genome Biol.4R7",{"doi":2415},"10.1186\u002Fgb-2003-4-1-r7",{"id":28,"text":2417,"url":28,"identifiers":2418},"Groth, D., et al. 2004GOblet: a platform for Gene Ontology annotation of anonymous sequence data. Nucleic Acids Res.32313–317",{"doi":2419},"10.1093\u002Fnar\u002Fgkh406",{"id":28,"text":2421,"url":28,"identifiers":2422},"Khan, S., et al. 2003GoFigure: automated Gene OntologyTM annotation. Bioinformatics192484–2485",{},{"id":28,"text":2424,"url":28,"identifiers":2425},"Martin, D., et al. 2004GOtcha: a new method for prediction of protein function assessed by the annotation of seven genomes. BMC Bioinformatics5178",{},{"id":28,"text":2427,"url":28,"identifiers":2428},"Zehetner, G. 2003OntoBlast function: from sequence similarities directly to potential functional annotations by ontology terms. Nucleic Acids Res.313799–3803",{"doi":2429},"10.1093\u002Fnar\u002Fgkg555",{"id":2431,"createTime":2432,"updateTime":2433,"relativeEntities":2434,"slug":2435,"properties":2436,"entityType":906,"verifyStatus":26,"verifyTime":2454,"verifyNote":961,"languages":2455,"translateLanguages":2456,"viewCount":32,"primaryUrl":2457,"fullTextUrl":28,"authors":2458,"publicationType":911,"publisherRelationship":2478,"citationCount":2498,"citationInfo":2499,"publishDate":2507,"publishYear":1689,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2508,"openAccess":28,"references":2509,"isForceReanalyzing":938},"bf5c0229-53a9-47bc-a52b-e3416c4e2c40","2024-09-26T16:44:51.105+00:00","2025-01-05T13:16:25.777+00:00",[],"Minimap2-pairwise-alignment-for-nucleotide-sequences",{"mag":2437,"keywords":2439,"pmc":2440,"openalex":2442,"abstract":2444,"title":2447,"pm":2450,"doi":2452},{"VOID":2438},"2789843538",{"VI":931},{"VOID":2441},"6137996",{"VOID":2443},"W2789843538",{"VI":2445,"EN":2446},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Động lực\u003C\u002Fjats:title>\n                  \u003Cjats:p>Các tiến bộ gần đây trong công nghệ giải trình tự hứa hẹn cung cấp các đoạn siêu dài khoảng 100 kb trung bình, các đoạn mRNA hoặc cDNA đầy đủ chiều dài với thông lượng cao và các đoạn gen có độ dài trên 100 Mb. Các chương trình căn chỉnh hiện có không thể hoặc không hiệu quả để xử lý dữ liệu như vậy ở quy mô lớn, điều này đặt ra yêu cầu phát triển các thuật toán căn chỉnh mới.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Kết quả\u003C\u002Fjats:title>\n                  \u003Cjats:p>Minimap2 là một chương trình căn chỉnh đa năng để ánh xạ DNA hoặc các chuỗi mRNA dài vào một cơ sở dữ liệu tham chiếu lớn. Nó hoạt động với các đoạn ngắn chính xác có độ dài ≥100 bp, các đoạn gen dài ≥1 kb với tỷ lệ lỗi khoảng 15%, các đoạn RNA thô đầy đủ chiều dài hoặc cDNA và các đoạn lắp ráp hoặc các nhiễm sắc thể đầy đủ liên quan chặt chẽ có độ dài hàng trăm megabases. Minimap2 thực hiện căn chỉnh split-read, sử dụng chi phí khoảng trống lõm cho các chèn và xóa dài và giới thiệu các phương pháp mới để giảm thiểu các căn chỉnh giả. Nó nhanh hơn từ 3–4 lần so với các chương trình căn chỉnh đọc ngắn chính thống với độ chính xác tương đương, và nhanh hơn ≥30 lần so với các chương trình căn chỉnh genomic hoặc cDNA dài với độ chính xác cao hơn, vượt qua hầu hết các chương trình căn chỉnh chuyên biệt cho một loại căn chỉnh.","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Motivation\u003C\u002Fjats:title>\n                  \u003Cjats:p>Recent advances in sequencing technologies promise ultra-long reads of ∼100 kb in average, full-length mRNA or cDNA reads in high throughput and genomic contigs over 100 Mb in length. Existing alignment programs are unable or inefficient to process such data at scale, which presses for the development of new alignment algorithms.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Results\u003C\u002Fjats:title>\n                  \u003Cjats:p>Minimap2 is a general-purpose alignment program to map DNA or long mRNA sequences against a large reference database. It works with accurate short reads of ≥100 bp in length, ≥1 kb genomic reads at error rate ∼15%, full-length noisy Direct RNA or cDNA reads and assembly contigs or closely related full chromosomes of hundreds of megabases in length. Minimap2 does split-read alignment, employs concave gap cost for long insertions and deletions and introduces new heuristics to reduce spurious alignments. It is 3–4 times as fast as mainstream short-read mappers at comparable accuracy, and is ≥30 times faster than long-read genomic or cDNA mappers at higher accuracy, surpassing most aligners specialized in one type of alignment.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Availability and implementation\u003C\u002Fjats:title>\n                  \u003Cjats:p>https:\u002F\u002Fgithub.com\u002Flh3\u002Fminimap2\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>\n               \u003Cjats:sec>\n                  \u003Cjats:title>Supplementary information\u003C\u002Fjats:title>\n                  \u003Cjats:p>Supplementary data are available at Bioinformatics online.\u003C\u002Fjats:p>\n               \u003C\u002Fjats:sec>",{"EN":2448,"VI":2449},"Minimap2: pairwise alignment for nucleotide sequences","Minimap2: căn chỉnh cặp cho các chuỗi nucleotide",{"VOID":2451},"29750242",{"VOID":2453},"10.1093\u002Fbioinformatics\u002Fbty191","2024-09-26T16:44:51.104+00:00",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F34\u002F18\u002F3094\u002F4994778",[2459],{"id":2460,"sortIndex":32,"researcher":28,"roles":2461,"affiliations":2462,"properties":2471,"displayName":2475,"givenName":28,"familyName":28},"a6e2230a-7a42-4428-99f2-29c86540b8dc",[],[2463],{"id":2464,"sortIndex":32,"affiliation":2465,"properties":28},"f22ddd3f-1187-4b68-b56d-5a73241764f1",{"id":2464,"createTime":28,"updateTime":28,"relativeEntities":2466,"slug":28,"properties":2467,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2470,"statistic":28},[],{"title":2468},{"EN":2469},"Department of Medical Population Genetics Program, Broad Institute, Cambridge, MA, USA",[],{"orcid":2472,"title":2474,"openalex":2476},{"VOID":2473},"https:\u002F\u002Forcid.org\u002F0000-0003-4874-2874",{"EN":2475},"Heng Li",{"VOID":2477},"A5100338825",{"url":28,"publisher":2479,"properties":2493},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2480,"slug":872,"properties":2481,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2484,"manageAffiliations":2485,"indexDatabases":2486,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2482,"title":2483},{"VOID":875},{"VOID":877},[],[],[2487],{"id":883,"indexDatabase":2488,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2489,"label":2490,"description":2491,"key":781,"publicationTags":2492,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":2494,"pages":2495,"volume":2497},{"VOID":2374},{"VOID":2496},"3094-3100",{"VOID":1686},9382,{"total":2498,"publishYear":1689,"statisticByYear":2500},{"2016":40,"2017":45,"2018":2501,"2019":38,"2020":2502,"2021":2503,"2022":2504,"2023":2505,"2024":2506},113,1068,1617,1916,2252,1741,"2018-09-15",[891],[2510,2514,2518,2522,2526,2530,2534,2538,2542,2546,2550,2554,2558,2561,2565,2569,2573,2575,2578,2582,2586,2588,2591,2595,2599,2603,2607,2611,2615,2619,2623,2627,2631,2635,2639,2643,2646],{"id":28,"text":2511,"url":28,"identifiers":2512},"Abouelhoda, 2005, Chaining algorithms for multiple genome comparison, J. Discrete Algorithms, 3, 321, 10.1016\u002Fj.jda.2004.08.011",{"doi":2513},"10.1016\u002Fj.jda.2004.08.011",{"id":28,"text":2515,"url":28,"identifiers":2516},"Altschul, 1986, Optimal sequence alignment using affine gap costs, Bull. Math. Biol, 48, 603, 10.1016\u002FS0092-8240(86)90010-8",{"doi":2517},"10.1016\u002FS0092-8240(86)90010-8",{"id":28,"text":2519,"url":28,"identifiers":2520},"Altschul, 1997, Gapped BLAST and PSI-BLAST: a new generation of protein database search programs, Nucleic Acids Res, 25, 3389, 10.1093\u002Fnar\u002F25.17.3389",{"doi":2521},"10.1093\u002Fnar\u002F25.17.3389",{"id":28,"text":2523,"url":28,"identifiers":2524},"Berlin, 2015, Assembling large genomes with single-molecule sequencing and locality-sensitive hashing, Nat. Biotechnol, 33, 623, 10.1038\u002Fnbt.3238",{"doi":2525},"10.1038\u002Fnbt.3238",{"id":28,"text":2527,"url":28,"identifiers":2528},"Byrne, 2017, Nanopore long-read RNAseq reveals widespread transcriptional variation among the surface receptors of individual B cells, Nat. Commun, 8, 16027., 10.1038\u002Fncomms16027",{"doi":2529},"10.1038\u002Fncomms16027",{"id":28,"text":2531,"url":28,"identifiers":2532},"Chaisson, 2012, Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory, BMC Bioinformatics, 13, 238., 10.1186\u002F1471-2105-13-238",{"doi":2533},"10.1186\u002F1471-2105-13-238",{"id":28,"text":2535,"url":28,"identifiers":2536},"Daily, 2016, Parasail: sIMD C library for global, semi-global, and local pairwise sequence alignments, BMC Bioinformatics, 17, 81., 10.1186\u002Fs12859-016-0930-z",{"doi":2537},"10.1186\u002Fs12859-016-0930-z",{"id":28,"text":2539,"url":28,"identifiers":2540},"Depristo, 2011, A framework for variation discovery and genotyping using next-generation DNA sequencing data, Nat. Genet, 43, 491, 10.1038\u002Fng.806",{"doi":2541},"10.1038\u002Fng.806",{"id":28,"text":2543,"url":28,"identifiers":2544},"Dobin, 2013, STAR: ultrafast universal RNA-seq aligner, Bioinformatics, 29, 15, 10.1093\u002Fbioinformatics\u002Fbts635",{"doi":2545},"10.1093\u002Fbioinformatics\u002Fbts635",{"id":28,"text":2547,"url":28,"identifiers":2548},"Farrar, 2007, Striped Smith-Waterman speeds database searches six times over other SIMD implementations, Bioinformatics, 23, 156, 10.1093\u002Fbioinformatics\u002Fbtl582",{"doi":2549},"10.1093\u002Fbioinformatics\u002Fbtl582",{"id":28,"text":2551,"url":28,"identifiers":2552},"Gotoh, 1982, An improved algorithm for matching biological sequences, J. Mol. Biol, 162, 705, 10.1016\u002F0022-2836(82)90398-9",{"doi":2553},"10.1016\u002F0022-2836(82)90398-9",{"id":28,"text":2555,"url":28,"identifiers":2556},"Gotoh, 1990, Optimal sequence alignment allowing for long gaps, Bull. Math. Biol, 52, 359, 10.1007\u002FBF02458577",{"doi":2557},"10.1007\u002FBF02458577",{"id":28,"text":2559,"url":28,"identifiers":2560},"Holtgrewe, 2010",{},{"id":28,"text":2562,"url":28,"identifiers":2563},"Irimia, 2008, Evolutionary convergence on highly-conserved 3’ intron structures in intron-poor eukaryotes and insights into the ancestral eukaryotic genome, PLoS Genet, 4, e1000148, 10.1371\u002Fjournal.pgen.1000148",{"doi":2564},"10.1371\u002Fjournal.pgen.1000148",{"id":28,"text":2566,"url":28,"identifiers":2567},"Iwata, 2012, Benchmarking spliced alignment programs including Spaln2, an extended version of Spaln that incorporates additional species-specific features, Nucleic Acids Res, 40, e161, 10.1093\u002Fnar\u002Fgks708",{"doi":2568},"10.1093\u002Fnar\u002Fgks708",{"id":28,"text":2570,"url":28,"identifiers":2571},"Jain, 2018, Nanopore sequencing and assembly of a human genome with ultra-long reads, Nat. Biotechnol., 36, 338, 10.1038\u002Fnbt.4060",{"doi":2572},"10.1038\u002Fnbt.4060",{"id":28,"text":1735,"url":28,"identifiers":2574},{"doi":1737},{"id":28,"text":2576,"url":28,"identifiers":2577},"Li, 2013, Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM, arXiv",{},{"id":28,"text":2579,"url":28,"identifiers":2580},"Li, 2016, Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences, Bioinformatics, 32, 2103, 10.1093\u002Fbioinformatics\u002Fbtw152",{"doi":2581},"10.1093\u002Fbioinformatics\u002Fbtw152",{"id":28,"text":2583,"url":28,"identifiers":2584},"Li, 2010, Fast and accurate long-read alignment with Burrows-Wheeler transform, Bioinformatics, 26, 589, 10.1093\u002Fbioinformatics\u002Fbtp698",{"doi":2585},"10.1093\u002Fbioinformatics\u002Fbtp698",{"id":28,"text":1742,"url":28,"identifiers":2587},{"doi":1137},{"id":28,"text":2589,"url":28,"identifiers":2590},"Li, 2017, New synthetic-diploid benchmark for accurate variant calling evaluation, bioRxiv",{},{"id":28,"text":2592,"url":28,"identifiers":2593},"Lin, 2017, Kart: a divide-and-conquer algorithm for NGS read alignment, Bioinformatics, 33, 2281, 10.1093\u002Fbioinformatics\u002Fbtx189",{"doi":2594},"10.1093\u002Fbioinformatics\u002Fbtx189",{"id":28,"text":2596,"url":28,"identifiers":2597},"Liu, 2016, rHAT: fast alignment of noisy long reads with regional hashing, Bioinformatics, 32, 1625, 10.1093\u002Fbioinformatics\u002Fbtv662",{"doi":2598},"10.1093\u002Fbioinformatics\u002Fbtv662",{"id":28,"text":2600,"url":28,"identifiers":2601},"Liu, 2017, LAMSA: fast split read alignment with long approximate matches, Bioinformatics, 33, 192, 10.1093\u002Fbioinformatics\u002Fbtw594",{"doi":2602},"10.1093\u002Fbioinformatics\u002Fbtw594",{"id":28,"text":2604,"url":28,"identifiers":2605},"Marçais, 2018, MUMmer4: a fast and versatile genome alignment system, PLoS Comput. Biol, 14, e1005944, 10.1371\u002Fjournal.pcbi.1005944",{"doi":2606},"10.1371\u002Fjournal.pcbi.1005944",{"id":28,"text":2608,"url":28,"identifiers":2609},"Ono, 2013, PBSIM: pacBio reads simulator—toward accurate genome assembly, Bioinformatics, 29, 119, 10.1093\u002Fbioinformatics\u002Fbts649",{"doi":2610},"10.1093\u002Fbioinformatics\u002Fbts649",{"id":28,"text":2612,"url":28,"identifiers":2613},"Roberts, 2004, Reducing storage requirements for biological sequence comparison, Bioinformatics, 20, 3363, 10.1093\u002Fbioinformatics\u002Fbth408",{"doi":2614},"10.1093\u002Fbioinformatics\u002Fbth408",{"id":28,"text":2616,"url":28,"identifiers":2617},"Robinson, 2011, Integrative genomics viewer, Nat. Biotechnol, 29, 24, 10.1038\u002Fnbt.1754",{"doi":2618},"10.1038\u002Fnbt.1754",{"id":28,"text":2620,"url":28,"identifiers":2621},"Sedlazeck, 2018, Accurate detection of complex structural variations using single-molecule sequencing, Nat. Methods, 10.1038\u002Fs41592-018-0001-7",{"doi":2622},"10.1038\u002Fs41592-018-0001-7",{"id":28,"text":2624,"url":28,"identifiers":2625},"Šošić, 2017, Edlib: a C\u002FC++ library for fast, exact sequence alignment using edit distance, Bioinformatics, 33, 1394, 10.1093\u002Fbioinformatics\u002Fbtw753",{"doi":2626},"10.1093\u002Fbioinformatics\u002Fbtw753",{"id":28,"text":2628,"url":28,"identifiers":2629},"Sović, 2016, Fast and sensitive mapping of nanopore sequencing reads with GraphMap, Nat. Commun, 7, 11307., 10.1038\u002Fncomms11307",{"doi":2630},"10.1038\u002Fncomms11307",{"id":28,"text":2632,"url":28,"identifiers":2633},"Suzuki, 2018, Introducing difference recurrence relations for faster semi-global alignment of long sequences, BMC Bioinformatics, 19, 45, 10.1186\u002Fs12859-018-2014-8",{"doi":2634},"10.1186\u002Fs12859-018-2014-8",{"id":28,"text":2636,"url":28,"identifiers":2637},"Wu, 1996, A subquadratic algorithm for approximate limited expression matching, Algorithmica, 15, 50, 10.1007\u002FBF01942606",{"doi":2638},"10.1007\u002FBF01942606",{"id":28,"text":2640,"url":28,"identifiers":2641},"Wu, 2005, GMAP: a genomic mapping and alignment program for mRNA and EST sequences, Bioinformatics, 21, 1859, 10.1093\u002Fbioinformatics\u002Fbti310",{"doi":2642},"10.1093\u002Fbioinformatics\u002Fbti310",{"id":28,"text":2644,"url":28,"identifiers":2645},"Zaharia, 2011, Faster and more accurate sequence alignment with SNAP, arXiv, 1111, 5572",{},{"id":28,"text":2647,"url":28,"identifiers":2648},"Zhang, 2006, Improved spliced alignment from an information theoretic approach, Bioinformatics, 22, 13, 10.1093\u002Fbioinformatics\u002Fbti748",{"doi":2649},"10.1093\u002Fbioinformatics\u002Fbti748",{"id":2651,"createTime":2652,"updateTime":2653,"relativeEntities":2654,"slug":2655,"properties":2656,"entityType":906,"verifyStatus":26,"verifyTime":2652,"verifyNote":961,"languages":2674,"translateLanguages":2675,"viewCount":32,"primaryUrl":2676,"fullTextUrl":28,"authors":2677,"publicationType":911,"publisherRelationship":2765,"citationCount":2787,"citationInfo":2788,"publishDate":2803,"publishYear":2789,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2804,"openAccess":28,"references":2805,"isForceReanalyzing":938},"c89d23ee-52a7-4eb2-be23-bdbbf6fa5e67","2024-09-30T21:29:43.544+00:00","2025-01-05T13:17:21.621+00:00",[],"Jalview-Version-2-a-multiple-sequence-alignment-editor-and-analysis-workbench",{"mag":2657,"keywords":2659,"pmc":2660,"openalex":2662,"abstract":2664,"title":2667,"pm":2670,"doi":2672},{"VOID":2658},"2120772351",{"VI":931},{"VOID":2661},"2672624",{"VOID":2663},"W2120772351",{"VI":2665,"EN":2666},"\u003Cjats:title>Tóm tắt\u003C\u002Fjats:title>\n               \u003Cjats:p>Tóm tắt: Jalview Phiên bản 2 là một hệ thống cho việc chỉnh sửa, phân tích và chú thích bố trí chuỗi đa dạng một cách tương tác và WYSIWYG. Các tính năng cốt lõi bao gồm chỉnh sửa dựa trên bàn phím và chuột, nhiều chế độ xem và tổng quan về bố trí, cũng như hiển thị cấu trúc liên kết với Jmol. Jalview 2 có sẵn dưới hai hình thức: một applet Java nhẹ cho việc sử dụng trong các ứng dụng web, và một ứng dụng desktop mạnh mẽ sử dụng dịch vụ web cho việc căn chỉnh chuỗi, dự đoán cấu trúc thứ cấp, và truy xuất các bố trí, chuỗi, chú thích và cấu trúc từ các cơ sở dữ liệu công cộng cùng bất kỳ máy chủ chuỗi hoặc chú thích nào tuân thủ DAS 1.53.\u003C\u002Fjats:p>\n               \u003Cjats:p>Sự có mặt: Ứng dụng Jalview 2 Desktop và applet JalviewLite được phát hành miễn phí dưới giấy phép GPL, và có thể được tải xuống từ www.jalview.org\u003C\u002Fjats:p>\n               \u003Cjats:p>Liên hệ:  g.j.barton@dundee.ac.uk\u003C\u002Fjats:p>","\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Summary: Jalview Version 2 is a system for interactive WYSIWYG editing, analysis and annotation of multiple sequence alignments. Core features include keyboard and mouse-based editing, multiple views and alignment overviews, and linked structure display with Jmol. Jalview 2 is available in two forms: a lightweight Java applet for use in web applications, and a powerful desktop application that employs web services for sequence alignment, secondary structure prediction and the retrieval of alignments, sequences, annotation and structures from public databases and any DAS 1.53 compliant sequence or annotation server.\u003C\u002Fjats:p>\n               \u003Cjats:p>Availability: The Jalview 2 Desktop application and JalviewLite applet are made freely available under the GPL, and can be downloaded from www.jalview.org\u003C\u002Fjats:p>\n               \u003Cjats:p>Contact:  g.j.barton@dundee.ac.uk\u003C\u002Fjats:p>",{"EN":2668,"VI":2669},"Jalview Version 2—a multiple sequence alignment editor and analysis workbench","Jalview Phiên bản 2—một công cụ chỉnh sửa và phân tích bố trí chuỗi đa dạng",{"VOID":2671},"19151095",{"VOID":2673},"10.1093\u002Fbioinformatics\u002Fbtp033",[31],[30],"https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle\u002F25\u002F9\u002F1189\u002F203460",[2678,2697,2714,2731,2748],{"id":2679,"sortIndex":32,"researcher":28,"roles":2680,"affiliations":2681,"properties":2690,"displayName":2694,"givenName":28,"familyName":28},"24ad80d9-beec-4959-bd91-b2eab914e02c",[],[2682],{"id":2683,"sortIndex":32,"affiliation":2684,"properties":28},"574ccee4-3b78-43c9-889e-84336f24d8bb",{"id":2683,"createTime":28,"updateTime":28,"relativeEntities":2685,"slug":28,"properties":2686,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2689,"statistic":28},[],{"title":2687},{"EN":2688},"1 School of Life Sciences Research, College of Life Sciences, University of Dundee, Dow Street, Dundee DD1 5EH, UK and 2Broad Institute, 7 Cambridge Center, Cambridge, MA 02142, USA",[],{"orcid":2691,"title":2693,"openalex":2695},{"VOID":2692},"https:\u002F\u002Forcid.org\u002F0009-0004-5717-6063",{"EN":2694},"Andrew Waterhouse",{"VOID":2696},"A5039618816",{"id":2698,"sortIndex":40,"researcher":28,"roles":2699,"affiliations":2700,"properties":2707,"displayName":2711,"givenName":28,"familyName":28},"03815719-e519-4248-b94b-f453348d58a5",[],[2701],{"id":2683,"sortIndex":32,"affiliation":2702,"properties":28},{"id":2683,"createTime":28,"updateTime":28,"relativeEntities":2703,"slug":28,"properties":2704,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2706,"statistic":28},[],{"title":2705},{"EN":2688},[],{"orcid":2708,"title":2710,"openalex":2712},{"VOID":2709},"https:\u002F\u002Forcid.org\u002F0000-0002-7865-7382",{"EN":2711},"James B Procter",{"VOID":2713},"A5023826543",{"id":2715,"sortIndex":123,"researcher":28,"roles":2716,"affiliations":2717,"properties":2724,"displayName":2728,"givenName":28,"familyName":28},"e597e7f5-ce2a-40b2-903c-1667e043aae5",[],[2718],{"id":2683,"sortIndex":32,"affiliation":2719,"properties":28},{"id":2683,"createTime":28,"updateTime":28,"relativeEntities":2720,"slug":28,"properties":2721,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2723,"statistic":28},[],{"title":2722},{"EN":2688},[],{"orcid":2725,"title":2727,"openalex":2729},{"VOID":2726},"https:\u002F\u002Forcid.org\u002F0000-0002-8732-204X",{"EN":2728},"David Martin",{"VOID":2730},"A5074551911",{"id":2732,"sortIndex":42,"researcher":28,"roles":2733,"affiliations":2734,"properties":2741,"displayName":2745,"givenName":28,"familyName":28},"3501651b-f927-42ae-9789-45451d77d3ce",[],[2735],{"id":2683,"sortIndex":32,"affiliation":2736,"properties":28},{"id":2683,"createTime":28,"updateTime":28,"relativeEntities":2737,"slug":28,"properties":2738,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2740,"statistic":28},[],{"title":2739},{"EN":2688},[],{"orcid":2742,"title":2744,"openalex":2746},{"VOID":2743},"https:\u002F\u002Forcid.org\u002F0000-0001-6907-177X",{"EN":2745},"Michèle Clamp",{"VOID":2747},"A5079580921",{"id":2749,"sortIndex":45,"researcher":28,"roles":2750,"affiliations":2751,"properties":2758,"displayName":2762,"givenName":28,"familyName":28},"3f69c56f-d931-4844-8932-94895f2b6909",[],[2752],{"id":2683,"sortIndex":32,"affiliation":2753,"properties":28},{"id":2683,"createTime":28,"updateTime":28,"relativeEntities":2754,"slug":28,"properties":2755,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2757,"statistic":28},[],{"title":2756},{"EN":2688},[],{"orcid":2759,"title":2761,"openalex":2763},{"VOID":2760},"https:\u002F\u002Forcid.org\u002F0000-0002-9014-5355",{"EN":2762},"Geoffrey J. Barton",{"VOID":2764},"A5082043302",{"url":28,"publisher":2766,"properties":2780},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2767,"slug":872,"properties":2768,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2771,"manageAffiliations":2772,"indexDatabases":2773,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2769,"title":2770},{"VOID":875},{"VOID":877},[],[],[2774],{"id":883,"indexDatabase":2775,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2776,"label":2777,"description":2778,"key":781,"publicationTags":2779,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],{"issue":2781,"pages":2783,"volume":2785},{"VOID":2782},"9",{"VOID":2784},"1189-1191",{"VOID":2786},"25",8855,{"total":2787,"publishYear":2789,"statisticByYear":2790},2009,{"2012":2791,"2013":2792,"2014":2793,"2015":2794,"2016":2795,"2017":2796,"2018":857,"2019":2797,"2020":2798,"2021":2799,"2022":2800,"2023":2801,"2024":2802},341,395,462,439,454,498,672,875,1000,984,923,658,"2009-05-01",[891],[2806,2810,2813,2817,2821,2824,2828,2831,2835,2839,2843,2847,2851,2854,2858,2862,2866,2870,2874,2878,2882,2886,2890,2894,2898,2901,2905,2909],{"id":28,"text":2807,"url":28,"identifiers":2808},"Barton, 1993, ALSCRIPT: a tool to format multiple sequence alignments, Protein Eng., 6, 37, 10.1093\u002Fprotein\u002F6.1.37",{"doi":2809},"10.1093\u002Fprotein\u002F6.1.37",{"id":28,"text":2811,"url":28,"identifiers":2812},"Blackshields, 2006, Analysis and comparison of benchmarks for multiple sequence alignment, In Silico Biol., 6, 321",{},{"id":28,"text":2814,"url":28,"identifiers":2815},"Boeckmann, 2003, The SWISS-PROT protein knowledgebase and its supplement TrEMBL in 2003, Nucleic Acids Res., 31, 365, 10.1093\u002Fnar\u002Fgkg095",{"doi":2816},"10.1093\u002Fnar\u002Fgkg095",{"id":28,"text":2818,"url":28,"identifiers":2819},"Clamp, 2004, The Jalview Java alignment editor, Bioinformatics, 20, 426, 10.1093\u002Fbioinformatics\u002Fbtg430",{"doi":2820},"10.1093\u002Fbioinformatics\u002Fbtg430",{"id":28,"text":2822,"url":28,"identifiers":2823},"Clark, 1992, MALIGNED: a multiple sequence alignment editor, Comput. Appl. Biosci., 8, 535",{},{"id":28,"text":2825,"url":28,"identifiers":2826},"Cole, 2008, The Jpred 3 secondary structure prediction server, Nucleic Acids Res., 36, W197, 10.1093\u002Fnar\u002Fgkn238",{"doi":2827},"10.1093\u002Fnar\u002Fgkn238",{"id":28,"text":2829,"url":28,"identifiers":2830},"De Rijk, 1993, DCSE, an interactive tool for sequence alignment and secondary structure research, Comput. Appl. Biosci., 9, 735",{},{"id":28,"text":2832,"url":28,"identifiers":2833},"De Rijk, 2003, RnaViz 2: an improved representation of RNA secondary structure, Bioinformatics, 19, 299, 10.1093\u002Fbioinformatics\u002F19.2.299",{"doi":2834},"10.1093\u002Fbioinformatics\u002F19.2.299",{"id":28,"text":2836,"url":28,"identifiers":2837},"Dowell, 2001, The distributed annotation system, BMC Bioinformatics, 2, 7, 10.1186\u002F1471-2105-2-7",{"doi":2838},"10.1186\u002F1471-2105-2-7",{"id":28,"text":2840,"url":28,"identifiers":2841},"Edgar, 2004, MUSCLE: multiple sequence alignment with high accuracy and high throughput, Nucleic Acids Res., 32, 1792, 10.1093\u002Fnar\u002Fgkh340",{"doi":2842},"10.1093\u002Fnar\u002Fgkh340",{"id":28,"text":2844,"url":28,"identifiers":2845},"Etzold, 1996, SRS: information retrieval system for molecular biology data banks, Methods Enzymol., 266, 114, 10.1016\u002FS0076-6879(96)66010-8",{"doi":2846},"10.1016\u002FS0076-6879(96)66010-8",{"id":28,"text":2848,"url":28,"identifiers":2849},"Finn, 2008, The Pfam protein families database, Nucleic Acids Res., 36, D281, 10.1093\u002Fnar\u002Fgkm960",{"doi":2850},"10.1093\u002Fnar\u002Fgkm960",{"id":28,"text":2852,"url":28,"identifiers":2853},"Galtier, 1996, SEAVIEW and PHYLO_WIN: two graphic tools for sequence alignment and molecular phylogeny, Comput. Appl. Biosci., 12, 543",{},{"id":28,"text":2855,"url":28,"identifiers":2856},"Ilyin, 2003, ModView, visualization of multiple protein sequences and structures, Bioinformatics, 19, 165, 10.1093\u002Fbioinformatics\u002F19.1.165",{"doi":2857},"10.1093\u002Fbioinformatics\u002F19.1.165",{"id":28,"text":2859,"url":28,"identifiers":2860},"Johnson, 2003, Protein family annotation in a multiple alignment viewer, Bioinformatics, 19, 544, 10.1093\u002Fbioinformatics\u002Fbtg021",{"doi":2861},"10.1093\u002Fbioinformatics\u002Fbtg021",{"id":28,"text":2863,"url":28,"identifiers":2864},"Katoh, 2005, MAFFT version 5: improvement in accuracy of multiple sequence alignment, Nucleic Acids Res., 33, 511, 10.1093\u002Fnar\u002Fgki198",{"doi":2865},"10.1093\u002Fnar\u002Fgki198",{"id":28,"text":2867,"url":28,"identifiers":2868},"Notredame, 2007, Recent evolutions of multiple sequence alignment algorithms, PLoS Comput. Biol., 3, e123, 10.1371\u002Fjournal.pcbi.0030123",{"doi":2869},"10.1371\u002Fjournal.pcbi.0030123",{"id":28,"text":2871,"url":28,"identifiers":2872},"Overton, 2008, TarO: a target optimisation system for structural biology, Nucleic Acids Res., 36, W190, 10.1093\u002Fnar\u002Fgkn141",{"doi":2873},"10.1093\u002Fnar\u002Fgkn141",{"id":28,"text":2875,"url":28,"identifiers":2876},"Pagni, 2007, MyHits: improvements to an interactive resource for analyzing protein sequences, Nucleic Acids Res., 35, W433, 10.1093\u002Fnar\u002Fgkm352",{"doi":2877},"10.1093\u002Fnar\u002Fgkm352",{"id":28,"text":2879,"url":28,"identifiers":2880},"Parry-Smith, 1998, CINEMA—a novel colour interactive editor for multiple alignments, Gene, 221, GC57, 10.1016\u002FS0378-1119(97)00650-1",{"doi":2881},"10.1016\u002FS0378-1119(97)00650-1",{"id":28,"text":2883,"url":28,"identifiers":2884},"Pettifer, 2004, UTOPIA-user-friendly tools for operating informatics applications, Comp. Funct. Genomics, 5, 56, 10.1002\u002Fcfg.359",{"doi":2885},"10.1002\u002Fcfg.359",{"id":28,"text":2887,"url":28,"identifiers":2888},"Pillai, 2005, SOAP-based services provided by the European Bioinformatics Institute, Nucleic Acids Res., 33, W25, 10.1093\u002Fnar\u002Fgki491",{"doi":2889},"10.1093\u002Fnar\u002Fgki491",{"id":28,"text":2891,"url":28,"identifiers":2892},"Prlic, 2007, Integrating sequence and structural biology with DAS, BMC Bioinformatics, 8, 333, 10.1186\u002F1471-2105-8-333",{"doi":2893},"10.1186\u002F1471-2105-8-333",{"id":28,"text":2895,"url":28,"identifiers":2896},"Raghava, 2003, OXBench: a benchmark for evaluation of protein multiple sequence alignment accuracy, BMC Bioinformatics, 4, 47, 10.1186\u002F1471-2105-4-47",{"doi":2897},"10.1186\u002F1471-2105-4-47",{"id":28,"text":2899,"url":28,"identifiers":2900},"Stockwell, 1987, HOMED: a homologous sequence editor, Comput. Appl. Biosci., 3, 37",{},{"id":28,"text":2902,"url":28,"identifiers":2903},"Thompson, 1994, CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice, Nucleic Acids Res., 22, 4673, 10.1093\u002Fnar\u002F22.22.4673",{"doi":2904},"10.1093\u002Fnar\u002F22.22.4673",{"id":28,"text":2906,"url":28,"identifiers":2907},"Thompson, 1997, The CLUSTAL_X windows interface: flexible strategies for multiple sequence alignment aided by quality analysis tools, Nucleic Acids Res., 25, 4876, 10.1093\u002Fnar\u002F25.24.4876",{"doi":2908},"10.1093\u002Fnar\u002F25.24.4876",{"id":28,"text":2910,"url":28,"identifiers":2911},"Thompson, 2006, MACSIMS: multiple alignment of complete sequences information management system, BMC Bioinformatics, 7, 318, 10.1186\u002F1471-2105-7-318",{"doi":2912},"10.1186\u002F1471-2105-7-318"]