Format
Sort by
Items per page

Send to

Choose Destination

Search results

Items: 12

1.

Sorting signed circular permutations by super short operations.

Oliveira AR, Fertin G, Dias U, Dias Z.

Algorithms Mol Biol. 2018 Jul 26;13:13. doi: 10.1186/s13015-018-0131-6. eCollection 2018.

2.

Matching algorithms for assigning orthologs after genome duplication events.

Fertin G, Hüffner F, Komusiewicz C, Sorge M.

Comput Biol Chem. 2018 Jun;74:379-390. doi: 10.1016/j.compbiolchem.2018.03.015. Epub 2018 Mar 14.

PMID:
29650458
3.

SpecOMS: A Full Open Modification Search Method Performing All-to-All Spectra Comparisons within Minutes.

David M, Fertin G, Rogniaux H, Tessier D.

J Proteome Res. 2017 Aug 4;16(8):3030-3038. doi: 10.1021/acs.jproteome.7b00308. Epub 2017 Jul 11.

PMID:
28660767
4.

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.

Fertin G, Jean G, Tannier E.

Algorithms Mol Biol. 2017 Jun 5;12:16. doi: 10.1186/s13015-017-0107-y. eCollection 2017.

5.

Sorting permutations by prefix and suffix rearrangements.

Lintzmayer CN, Fertin G, Dias Z.

J Bioinform Comput Biol. 2017 Feb;15(1):1750002. doi: 10.1142/S0219720017500020. Epub 2017 Feb 9.

PMID:
28201946
6.

Genome rearrangements with indels in intergenes restrict the scenario space.

Bulteau L, Fertin G, Tannier E.

BMC Bioinformatics. 2016 Nov 11;17(Suppl 14):426. doi: 10.1186/s12859-016-1264-6.

7.

Hybrid de novo tandem repeat detection using short and long reads.

Fertin G, Jean G, Radulescu A, Rusu I.

BMC Med Genomics. 2015;8 Suppl 3:S5. doi: 10.1186/1755-8794-8-S3-S5. Epub 2015 Sep 23.

8.

Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes.

Angibaud S, Fertin G, Rusu I, Thévenin A, Vialette S.

J Comput Biol. 2008 Oct;15(8):1093-115. doi: 10.1089/cmb.2008.0061.

PMID:
18774903
9.

Exemplar longest common subsequence.

Bonizzoni P, Della Vedova G, Dondi R, Fertin G, Rizzi R, Vialette S.

IEEE/ACM Trans Comput Biol Bioinform. 2007 Oct-Dec;4(4):535-43.

PMID:
17975265
10.

Comparing genomes with duplications: a computational complexity point of view.

Blin G, Chauve C, Fertin G, Rizzi R, Vialette S.

IEEE/ACM Trans Comput Biol Bioinform. 2007 Oct-Dec;4(4):523-34.

PMID:
17975264
11.

A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates.

Angibaud S, Fertin G, Rusu I, Vialette S.

J Comput Biol. 2007 May;14(4):379-93.

PMID:
17572018
12.

Recursive graphs with small-world scale-free properties.

Comellas F, Fertin G, Raspaud A.

Phys Rev E Stat Nonlin Soft Matter Phys. 2004 Mar;69(3 Pt 2):037104. Epub 2004 Mar 31.

PMID:
15089444

Supplemental Content

Loading ...
Support Center