{"title":"核苷酸序列可视化","authors":"Tomas Rekašius","doi":"10.15388/lmr.2006.30765","DOIUrl":null,"url":null,"abstract":"The paper reviews the visualisation problems of genetic sequences and of their analysis results as well as other related problems. A possible formulation of the problem based on similarity, complexity measure (distance) between DNA sequences is proposed. It is solved by making use of multidimensional scaling (MDS) of principal component analysis (PCA) methods.","PeriodicalId":33611,"journal":{"name":"Lietuvos Matematikos Rinkinys","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Visualisation of nucleotide sequences\",\"authors\":\"Tomas Rekašius\",\"doi\":\"10.15388/lmr.2006.30765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper reviews the visualisation problems of genetic sequences and of their analysis results as well as other related problems. A possible formulation of the problem based on similarity, complexity measure (distance) between DNA sequences is proposed. It is solved by making use of multidimensional scaling (MDS) of principal component analysis (PCA) methods.\",\"PeriodicalId\":33611,\"journal\":{\"name\":\"Lietuvos Matematikos Rinkinys\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lietuvos Matematikos Rinkinys\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15388/lmr.2006.30765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lietuvos Matematikos Rinkinys","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15388/lmr.2006.30765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The paper reviews the visualisation problems of genetic sequences and of their analysis results as well as other related problems. A possible formulation of the problem based on similarity, complexity measure (distance) between DNA sequences is proposed. It is solved by making use of multidimensional scaling (MDS) of principal component analysis (PCA) methods.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
