A scalable parallelization of the gene duplication problem
From MaRDI portal
Publication:666045
DOI10.1016/j.jpdc.2009.09.010zbMath1233.68206OpenAlexW2019947476MaRDI QIDQ666045
Oliver Eulenstein, Wen-Chieh Chang, Srinivas Aluru, André Wehe
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.09.010
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Protein sequences, DNA sequences (92D20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computational complexity of the rooted subtree prune and regraft distance
- Reconstruction of large phylogenetic trees: a parallel approach
- Fast Algorithms for Finding Nearest Common Ancestors
- Comparative Genomics
- Subtree transfer operations and their induced metrics on evolutionary trees