| [C-B 2010] |
N. Castells-Brooke.
Beginner's guide to molecular biology.
web pages. [ bib | http ] |
| [SM 1997] |
J. C. Setubal and J. Meidanis.
Introduction to Computational Molecular Biology.
PWS Publishing Company, 1997.
ISBN: 0-534-95262-3. [ bib ] |
| [PS 2011] |
P. Pevzner, R. Shamir, eds.
Bioinformatics for Biologists.
Cambridge University Press, 2011.
ISBN: 978-1-107-64887-6. [ bib | |
| [Durand 2014] |
D. Durand.
Markov models for sequence evolution.
Lecture notes, 2014.
Kindly made available by author. [ bib ] | http ] |
| [Eddy 2005] |
S. R. Eddy.
Antedisciplinary science.
PLoS Comput. Biol., 1(1):3-4, 2005.
e6. [ bib | .pdf ] |
| [Doolittle 2000] |
R. F. Doolittle.
On the trail of protein sequences.
Bioinformatics, 16(1):24-33, 2000. [ bib | .pdf ] |
| [Felsenstein 2004] |
J. Felsenstein.
Inferring Phylogenies.
Sinauer Associates, Inc., 2004.
ISBN: 0-87893-177-5. [ bib ] |
| [FM 2011] |
P. Feijao and J. Meidanis.
SCJ: A Breakpoint-Like Distance that Simplifies Several
Rearrangement Problems.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5):1318-1329, 2011. [ bib | html ] |
| [YAF 2005] |
S. Yancopoulos, O. Attie, and R. Friedberg.
Efficient sorting of genomic permutations by translocation, inversion
and block interchange.
Bioinformatics, 21(16):3340-3346, 2005. [ bib | .pdf ] |
| [FM 2013] |
P. Feijao and J. Meidanis.
Extending the Algebraic Formalism for Genome Rearrangements
to Include Linear Chromosomes.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10(4):819-831, 2013. [ bib | html ] |
| [ZBM 2013] |
J. P. Zanetti, P. Biller, and J. Meidanis.
On the Matrix Median Problem.
Proceedings of the 13th International Workshop on Algorithms in Bioinformatics (WABI 2013), 2013. [ bib | html | algorithm ] |
| [HP 1999] |
S. Hannenhalli and P. A. Pevzner.
Transforming Cabbage into Turnip: Polynomial
Algorithm for Sorting Signed Permutations by Reversals.
Journal of the ACM, 46(1):1-27, 1999. [ bib | html ] |
| [Bergeron 2005] |
Anne Bergeron.
A very elementary presentation of the Hannenhalli-Pevzner theory.
Discrete Applied Mathematics, 146:134-145, 2005. [ bib | .pdf ] |
| [Christie 1996] |
David A. Christie.
Sorting permutations by block-interchanges.
Information Processing Letters, 60(4):165-169, 1996. [ bib | html ] |
| [Benzer 1959] |
S. Benzer.
On the topology of the genetic fine structure.
Proc. Nat. Acad. Sci. - USA, 45:1607-1620, 1959. [ bib | .pdf ] |
| [BL 1976] |
K. S. Booth and G. S. Lueker.
Testing for the consecutive ones property, interval graphs, and graph
planarity using PQ-tree algorithms.
J. Comput. Systems Sci., 13(3):335-379, 1976. [ bib ] | .pdf ] |
| [MPT 1998] |
J. Meidanis, O. Porto, and G. P. Telles.
On the consecutive ones property.
Discrete Applied Mathematics, 88:325-354, 1998. [ bib | .pdf ] |