Suchergebnisse - (( computing algorithms and informatics ) OR ( computing algorithms and informatika ))*
-
1
Molecular Computing and Bioinformatics
ISSN: 1420-3049, 1420-3049Veröffentlicht: Switzerland MDPI AG 26.06.2019Veröffentlicht in Molecules (Basel, Switzerland) (26.06.2019)“… Molecular computing and bioinformatics are two important interdisciplinary sciences that study molecules and computers …”
Volltext
Journal Article -
2
New classifications for quantum bioinformatics: Q-bioinformatics, QCt-bioinformatics, QCg-bioinformatics, and QCr-bioinformatics
ISSN: 1467-5463, 1477-4054, 1477-4054Veröffentlicht: England Oxford University Press 22.01.2024Veröffentlicht in Briefings in bioinformatics (22.01.2024)“… s. This new field employs the principles of quantum mechanics, quantum algorithms, and quantum computing to solve complex problems in molecular biology, drug design, and protein folding …”
Volltext
Journal Article -
3
A fast adaptive algorithm for computing whole-genome homology maps
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Veröffentlicht: England Oxford University Press 01.09.2018Veröffentlicht in Bioinformatics (01.09.2018)“… Results We introduce an approximate algorithm for computing local alignment boundaries between long DNA sequences …”
Volltext
Journal Article -
4
The second age of computer science : from ALGOL genes to neural nets
ISBN: 9780190843861, 0190843861Veröffentlicht: New York Oxford University Press 2018“… Between the genesis of computer science in the 1960s and the advent of the World Wide Web around 1990, computer science evolved in significant ways. The author …”
Volltext
E-Book Buch -
5
Quantum computing in bioinformatics: a systematic review mapping
ISSN: 1467-5463, 1477-4054, 1477-4054Veröffentlicht: England Oxford University Press 25.07.2024Veröffentlicht in Briefings in bioinformatics (25.07.2024)“… Abstract The field of quantum computing (QC) is expanding, with efforts being made to apply it to areas previously covered by classical algorithms and methods …”
Volltext
Journal Article -
6
Next-generation bioinformatics: using many-core processor architecture to develop a web service for sequence alignment
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Veröffentlicht: Oxford Oxford University Press 01.03.2010Veröffentlicht in Bioinformatics (01.03.2010)“… Motivation: Bioinformatics algorithms and computing power are the main bottlenecks for analyzing huge amount of data generated by the current technologies, such as the ‘next-generation …”
Volltext
Journal Article -
7
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
ISSN: 0022-0000, 1090-2724Veröffentlicht: Elsevier Inc 01.03.2005Veröffentlicht in Journal of computer and system sciences (01.03.2005)“… ) -time algorithm, improving upon the O ( n log L ) -time algorithm by Lin, Jiang and Chao …”
Volltext
Journal Article -
8
BOA: A partitioned view of genome assembly
ISSN: 2589-0042, 2589-0042Veröffentlicht: Elsevier Inc 18.11.2022Veröffentlicht in iScience (18.11.2022)“… De novo genome assembly is a fundamental problem in computational molecular biology that aims to reconstruct an unknown genome sequence from a set of short DNA …”
Volltext
Journal Article -
9
Heart beats in the cloud: distributed analysis of electrophysiological 'Big Data' using cloud computing for epilepsy clinical research
ISSN: 1527-974X, 1527-974XVeröffentlicht: England 01.03.2014Veröffentlicht in Journal of the American Medical Informatics Association : JAMIA (01.03.2014)“… To facilitate secondary use of these data, there is an urgent need to develop novel algorithms and informatics approaches using new cloud computing technologies as well as ontologies …”
Weitere Angaben
Journal Article -
10
Fast algorithms for computing phylogenetic divergence time
ISSN: 1471-2105, 1471-2105Veröffentlicht: London BioMed Central 06.12.2017Veröffentlicht in BMC bioinformatics (06.12.2017)“… In this work, we present a new algorithm, AncestralAge, that significantly improves the performance of the divergence time process …”
Volltext
Journal Article -
11
Comparison and improvement of algorithms for computing minimal cut sets
ISSN: 1471-2105, 1471-2105Veröffentlicht: London BioMed Central 06.11.2013Veröffentlicht in BMC bioinformatics (06.11.2013)“… Two different algorithmic schemes (adapted Berge algorithm and binary integer programming …”
Volltext
Journal Article -
12
Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets
ISBN: 364208303X, 9783642083037, 3662036886, 3540627529, 9783662036884, 9783540627524Veröffentlicht: Berlin, Heidelberg Springer Berlin / Heidelberg 1998“… Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control …”
Volltext
E-Book -
13
Engineering informatics: fundamentals of computer-aided engineering
ISBN: 1119953413, 9781119953418, 9781118536322, 1118536320Veröffentlicht: Wiley 01.01.2013“… ). Engineering Informatics: Fundamentals of Computer-Aided Engineering, 2nd Edition provides the foundation knowledge of computing that is essential for all engineers …”
Volltext
E-Book -
14
Performance and scaling behavior of bioinformatic applications in virtualization environments to create awareness for the efficient use of compute resources
ISSN: 1553-7358, 1553-734X, 1553-7358Veröffentlicht: United States Public Library of Science 01.07.2021Veröffentlicht in PLoS computational biology (01.07.2021)“… The large amount of biological data available in the current times, makes it necessary to use tools and applications based on sophisticated and efficient algorithms, developed in the area of bioinformatic …”
Volltext
Journal Article -
15
High-throughput screening of stable and efficient double inorganic halide perovskite materials by DFT
ISSN: 2045-2322, 2045-2322Veröffentlicht: London Nature Publishing Group UK 25.07.2022Veröffentlicht in Scientific reports (25.07.2022)“… In this paper, the inorganic halide double perovskite A 2 BX 6 and its crystal structure are considered, and the data mining algorithm in informatics is introduced into the high-throughput computing …”
Volltext
Journal Article -
16
A Multi-Objective Genetic Algorithm-Based Resource Scheduling in Mobile Cloud Computing
ISSN: 1557-3958, 1557-3966Veröffentlicht: Hershey IGI Global 01.07.2021Veröffentlicht in International journal of cognitive informatics & natural intelligence (01.07.2021)“… Mobile cloud computing is an emerging technology in recent years. This technology reduces battery consumption and execution time by executing mobile applications in remote cloud server …”
Volltext
Journal Article -
17
Differentially Private Asynchronous Federated Learning for Mobile Edge Computing in Urban Informatics
ISSN: 1551-3203, 1941-0050Veröffentlicht: Piscataway IEEE 01.03.2020Veröffentlicht in IEEE transactions on industrial informatics (01.03.2020)“… Driven by technologies such as mobile edge computing and 5G, recent years have witnessed the rapid development of urban informatics, where a large amount of data is generated …”
Volltext
Journal Article -
18
A practical O(n log2n) time algorithm for computing the triplet distance on binary trees
ISSN: 1471-2105, 1471-2105Veröffentlicht: London BioMed Central 21.01.2013Veröffentlicht in BMC bioinformatics (21.01.2013)“… ). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O ( n log n …”
Volltext
Journal Article -
19
Complexity and Real Computation
ISBN: 9781461268734, 1461268737, 9780387982816, 1461207029, 9781461207023, 0387982817Veröffentlicht: New York, NY Springer New York 1997“… The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms …”
Volltext
E-Book -
20
Rfold: an exact algorithm for computing local base pairing probabilities
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Veröffentlicht: Oxford Oxford University Press 01.02.2008Veröffentlicht in Bioinformatics (01.02.2008)“… Recently, there has been a growing need for computing these probabilities for long DNA sequences by constraining the maximal span of base pairs to a limited value …”
Volltext
Journal Article

