Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Sahar Hooshmand"'
Publikováno v:
BMC Bioinformatics, Vol 21, Iss S6, Pp 1-12 (2020)
Abstract Background Alignment-free methods for sequence comparisons have become popular in many bioinformatics applications, specifically in the estimation of sequence similarity measures to construct phylogenetic trees. Recently, the average common
Externí odkaz:
https://doaj.org/article/96db9fcf7ab54535b9a6b3d9e2ce192f
Publikováno v:
Applied Sciences, Vol 12, Iss 21, p 10746 (2022)
The purpose of this article is to illustrate an investigation of methods that can be effectively used to predict the data incompleteness of a dataset. Here, the investigators have conceptualized data incompleteness as a random variable, with the over
Externí odkaz:
https://doaj.org/article/9ad8ec5f00434514b4fc63d53bb2b6f0
Publikováno v:
Algorithmica. 84:2088-2105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1367395cdef6f6d57afc0e8752b681c3
https://doi.org/10.1007/s00453-022-00955-7
https://doi.org/10.1007/s00453-022-00955-7
Autor:
Jodh Singh Pannu, Sharma V. Thankachan, Sahar Hooshmand, Sriram P. Chockalingam, Srinivas Aluru
Publikováno v:
BMC Bioinformatics, Vol 21, Iss S6, Pp 1-12 (2020)
BMC Bioinformatics
BMC Bioinformatics
Background Alignment-free methods for sequence comparisons have become popular in many bioinformatics applications, specifically in the estimation of sequence similarity measures to construct phylogenetic trees. Recently, the average common substring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b18717b4ab64a7bb48b453548113843c
http://link.springer.com/article/10.1186/s12859-020-03738-5
http://link.springer.com/article/10.1186/s12859-020-03738-5
The non-overlapping indexing problem is defined as follows: pre-process a given text T [ 1 , n ] of length n into a data structure such that whenever a pattern P [ 1 , m ] comes as an input, we can efficiently report the largest set of non-overlappin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cd795c04bd0d62ccf342f2f48361721
https://aperta.ulakbim.gov.tr/record/237248
https://aperta.ulakbim.gov.tr/record/237248
Publikováno v:
Fundamenta Informaticae. 163:267-273
The Average Common Substring (ACS) is a popular alignment-free distance measure for phylogeny reconstruction. The ACS can be computed in O(n) space and time, where n=x+y is the input size. The compressed string matching is the study of string matchin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dce0fac42ed8e832fbd09b37cd47a251
https://doi.org/10.3233/fi-2018-1743
https://doi.org/10.3233/fi-2018-1743
Publikováno v:
ICCABS
The genome mappability problem refers to cataloging repetitive occurrences of every substring of length m in a genome, and its k-mappability variant extends this to approximate repeats by allowing up to k mismatches. This problem is formulated as fol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::877b3cb1922278e6f4cfd61510573c51
https://doi.org/10.1109/iccabs.2018.8541897
https://doi.org/10.1109/iccabs.2018.8541897
Publikováno v:
BCB
\beginthebibliography 1 \bibitemalzamel2017faster M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, and W.-K. Sung. \newblock Faster algorithms for 1-mappability of a sequence. \newblock In \em International Conference
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dd00f8b141566324d5f4cc573e14d48
https://doi.org/10.1145/3233547.3233645
https://doi.org/10.1145/3233547.3233645
Publikováno v:
Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
The non-overlapping indexing problem is defined as follows: pre-process a given text T[1,n] of length n into a data structure such that whenever a pattern P[1,p] comes as an input, we can efficiently report the largest set of non-overlapping occurren
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e7c06234a3adcd98c8e64fa251e0f08
Autor:
Shobha Udipi, Sahar Hooshmand
Publikováno v:
International Journal of Nutrition and Food Sciences. 3:455
Background: Malnutrition is a widespread problem in developing countries. Information on nutritional status of primary school children are not enough in Iran and India. The present study, made to assess prevalence of undernutrtion, stunting and wasti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::459b38339c18314df0ca23d7a996782b
https://doi.org/10.11648/j.ijnfs.20140305.24
https://doi.org/10.11648/j.ijnfs.20140305.24