Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Mohammed W. Al-Neama"'
Publikováno v:
UHD Journal of Science and Technology, Vol 1, Iss 2, Pp 13-24 (2017)
In this paper, we introduce an improved parallel algorithm for computing the number of exact matches nid (S,T) in the local alignment of two biological sequences S and T. This number is used in the first stage of progressive alignment to compute the
Externí odkaz:
https://doaj.org/article/90dec4df9acb4f1e823ab729ca572cb5
The traveling salesman problem (TSP) is a problem in computer science that has been extensively studied and has a wide variety of real-world applications. It is considered an NP-hard issue since the only way to get a precise solution to it is to wait
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::ff150907ec60b345dabb52d7e26fdef6
https://zenodo.org/record/8158034
https://zenodo.org/record/8158034
Publikováno v:
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software". 13:107-118
W.B. Yahia1, M.W. Al-Neama2, G.E. Arif1 1Tikrit University, Tikrit, Iraq 2Mosul University, Mosul, Iraq E-mails: warifb@gmail.com, mwneama@uomosul.edu.iq, ghasanarif@tu.edu.iq Вариф Яхия, Университет Тикрита (г. Тикри
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb9d5d1a8289cee7e40acf92000298f2
https://doi.org/10.14529/mmp200409
https://doi.org/10.14529/mmp200409
Publikováno v:
PROCEEDING OF THE 1ST INTERNATIONAL CONFERENCE ON ADVANCED RESEARCH IN PURE AND APPLIED SCIENCE (ICARPAS2021): Third Annual Conference of Al-Muthanna University/College of Science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ceb4a2f0927934cb26213e083c53a63e
https://doi.org/10.1063/5.0093571
https://doi.org/10.1063/5.0093571
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030387518
ACRIT
ACRIT
Multiple spatial alignments of protein structures are an important tool of structural biology. Analysis of protein structures allows us to establish their homology; i.e., the origin from a common ancestor. The rapid growth in the number of known prot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e2e257fb310ef8b981bfa09e123b9ad
https://doi.org/10.1007/978-3-030-38752-5_3
https://doi.org/10.1007/978-3-030-38752-5_3
Publikováno v:
2019 International Engineering Conference (IEC).
Due to the gigantic explosion in the amount of molecular data, a high-quality global sequence alignment (GA) becomes a big dilemma nowadays. the similarity matrix computations phase is the most consuming time and space. This paper addresses this issu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8401972a478689f829c0a0d60419a385
https://doi.org/10.1109/iec47844.2019.8950543
https://doi.org/10.1109/iec47844.2019.8950543
Publikováno v:
2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT).
Multiple Sequence Alignment (MSA) is a basic tool for bioinformatics research and analysis. It generally constitutes the foundation of many bioinformatics studies. MSAProbs is considered the most accurate MSA tool which is based-on pair Hidden Markov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80754e513b5745cbac1a76d378cf2ecf
https://doi.org/10.1109/crcsit.2017.7965557
https://doi.org/10.1109/crcsit.2017.7965557
Publikováno v:
International Journal of Advanced Computer Science and Applications. 7
For biologists, the existence of an efficient tool for multiple sequence alignment is essential. This work presents a new parallel aligner called HAMSA. HAMSA is a bioinformatics application designed for highly accelerated alignment of multiple seque
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf2e3693a35ca6ea61561a99cce54248
https://doi.org/10.14569/ijacsa.2016.070661
https://doi.org/10.14569/ijacsa.2016.070661
Publikováno v:
Al-Rafidain Journal of Computer Sciences and Mathematics, Vol 7, Iss 3, Pp 51-60 (2010)
Mostly minimization or maximization of a function is very expensive. Since function evaluation of the objective function requires a considerable time. Hence, our objective in this work is the development of parallel algorithms for minimization of obj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b61a436bc6370f670d7d149bed2f8add
https://csmj.mosuljournals.com/article_163909_ca812f96cff47b152cc0ecf848847b24.pdf
https://csmj.mosuljournals.com/article_163909_ca812f96cff47b152cc0ecf848847b24.pdf
Publikováno v:
BioMed Research International, Vol 2014 (2014)
BioMed Research International
BASE-Bielefeld Academic Search Engine
BioMed Research International
BASE-Bielefeld Academic Search Engine
Distance matrix has diverse usage in different research areas. Its computation is typically an essential task in most bioinformatics applications, especially in multiple sequence alignment. The gigantic explosion of biological sequence databases lead
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc14006e344c1d36387874fbf042b4f0
https://doaj.org/article/4446ea3e9c2b4a8c8e74c16bad2727d3
https://doaj.org/article/4446ea3e9c2b4a8c8e74c16bad2727d3