FluReF, an automated flu virus reassortment finder based on phylogenetic trees.

PubWeight™: 0.85‹?›

🔗 View Article (PMC 3194234)

Published in BMC Genomics on July 27, 2011

Authors

Alisa Yurovsky1, Bernard M E Moret

Author Affiliations

1: Department of Computer Science, EPFL (Swiss Federal Institute of Technology), Lausanne, CH-1015, Switzerland. alisa.yurovsky@gmail.com

Articles cited by this

A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J Mol Evol (1980) 113.75

MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res (2002) 47.62

A rapid bootstrap algorithm for the RAxML Web servers. Syst Biol (2008) 38.22

Mapping the antigenic and genetic evolution of influenza virus. Science (2004) 14.28

The genomic and epidemiological dynamics of human influenza A virus. Nature (2008) 10.26

Ecological and immunological determinants of influenza evolution. Nature (2003) 7.60

Influenza in tropical regions. PLoS Med (2006) 6.82

Whole-genome analysis of human influenza A virus reveals multiple persistent lineages and reassortment among recent H3N2 viruses. PLoS Biol (2005) 5.48

Sequence of the 1918 pandemic influenza virus nonstructural gene (NS) segment and characterization of recombinant viruses bearing the 1918 NS genes. Proc Natl Acad Sci U S A (2001) 4.93

Seasonality of influenza in Brazil: a traveling wave from the Amazon to the subtropics. Am J Epidemiol (2007) 4.06

Genetic analysis of human H2N2 and early H3N2 influenza viruses, 1957-1972: evidence for genetic divergence and multiple reassortment events. Virology (2004) 2.44

Comparison of the mutation rates of human influenza A and B viruses. J Virol (2006) 2.17

2009 Swine-origin influenza A (H1N1) resembles previous influenza isolates. PLoS One (2009) 1.32

Non-random reassortment in human influenza A viruses. Influenza Other Respir Viruses (2008) 1.20

Evolution of the influenza a virus: some new advances. Evol Bioinform Online (2008) 0.84

Articles by these authors

How many bootstrap replicates are necessary? J Comput Biol (2010) 6.02

Uncovering hidden phylogenetic consensus in large data sets. IEEE/ACM Trans Comput Biol Bioinform (2011) 3.31

Estimating true evolutionary distances under the DCJ model. Bioinformatics (2008) 1.62

Scaling up accurate phylogenetic reconstruction from gene-order data. Bioinformatics (2003) 1.50

Estimating true evolutionary distances under rearrangements, duplications, and losses. BMC Bioinformatics (2010) 1.13

Efficiently computing the Robinson-Foulds metric. J Comput Biol (2007) 1.12

Towards the development of computational tools for evaluating phylogenetic network reconstruction methods. Pac Symp Biocomput (2003) 1.02

Maximum likelihood phylogenetic reconstruction from high-resolution whole-genome data and a tree of 68 eukaryotes. Pac Symp Biocomput (2013) 1.02

Distance-based genome rearrangement phylogeny. J Mol Evol (2006) 0.98

ChIPnorm: a statistical method for normalizing and identifying differential regions in histone modification ChIP-seq libraries. PLoS One (2012) 0.96

Inversion-based genomic signatures. BMC Bioinformatics (2009) 0.96

Fast phylogenetic methods for the analysis of genome rearrangement data: an empirical study. Pac Symp Biocomput (2002) 0.96

A metric for phylogenetic trees based on matching. IEEE/ACM Trans Comput Biol Bioinform (2012) 0.92

Refining transcriptional regulatory networks using network evolutionary models and gene histories. Algorithms Mol Biol (2010) 0.92

Gene rearrangement analysis and ancestral order inference from chloroplast genomes with inverted repeat. BMC Genomics (2008) 0.88

Heuristics for the inversion median problem. BMC Bioinformatics (2010) 0.88

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes. J Comput Biol (2014) 0.87

A new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes. J Comput Biol (2011) 0.84

Maximum independent sets of commuting and noninterfering inversions. BMC Bioinformatics (2009) 0.82

The accuracy of fast phylogenetic methods for large datasets. Pac Symp Biocomput (2002) 0.82

Sorting signed permutations by inversions in O(nlogn) time. J Comput Biol (2010) 0.81

TIBA: a tool for phylogeny inference from rearrangement data with bootstrap analysis. Bioinformatics (2012) 0.80

Study of cell differentiation by phylogenetic analysis using histone modification data. BMC Bioinformatics (2014) 0.79

Refining regulatory networks through phylogenetic transfer of information. IEEE/ACM Trans Comput Biol Bioinform (2012) 0.78

Inferring transcript phylogenies. BMC Bioinformatics (2012) 0.75

Hurdles and sorting by inversions: combinatorial, statistical, and experimental results. J Comput Biol (2009) 0.75

NEMo: An Evolutionary Model with Modularity for PPI Networks. IEEE Trans Nanobioscience (2017) 0.75