Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A More Efficient Approximation Scheme for Tree Alignment - MaRDI portal

A More Efficient Approximation Scheme for Tree Alignment

From MaRDI portal

Publication:4507349

Jump to:navigation, search

DOI10.1137/S0097539796313507zbMath0965.05034MaRDI QIDQ4507349

Tao Jiang, Lusheng Wang, Dan Gusfield

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

approximation algorithm multiple sequence alignment phylogeny computational biology evolutionary tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Applications of graph theory (05C90) General biology and biomathematics (92B05)

Related Items (6)

Methods for reconstructing the history of tandem repeats and their application to the human genome. ⋮ A few logs suffice to build (almost) all trees. II ⋮ A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION ⋮ Approximation algorithms for constrained generalized tree alignment problem ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation ⋮ Fixed topology alignment with recombination

This page was built for publication: A More Efficient Approximation Scheme for Tree Alignment

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4507349&oldid=18602063"