Genome rearrangements: a correct algorithm for optimal capping
From MaRDI portal
Publication:2379988
DOI10.1016/j.ipl.2007.04.011zbMath1183.92034OpenAlexW2063731178MaRDI QIDQ2379988
Géraldine Jean, Macha Nikolski
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.011
Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items
HP Distance Via Double Cut and Join Distance, A new linear time algorithm to compute the genomic distance via the double cut and join distance, Rearrangements in Phylogenetic Inference: Compare, Model, or Encode?
Cites Work