| [1] |
J. Meidanis.
Current challenges in bioinformatics.
In Mario A. Nascimento, Edleno Silva de Moura, and Arlindo L.
Oliveira, editors, Proc. of SPIRE'2003 - String Processing and
Information Retrieval Symposium, volume 2857 of Lecture Notes in
Computer Science, pages 16-27. Springer, 2003. [ bib | .pdf ] |
| [2] |
P. Pevzner.
Educating biologists in the 21st century: bioinformatics scientists
versus bioinformatics technicians.
Bioinformatics, 20(14):2159-2161, 2004.
Editorial. [ bib | .pdf ] |
| [3] |
S. R. Eddy.
Antedisciplinary science.
PLoS Comput. Biol., 1(1):3-4, 2005.
e6. [ bib | .pdf ] |
| [4] |
J. C. Setubal and J. Meidanis.
Introduction to Computational Molecular Biology.
PWS Publishing Company, 1997.
ISBN: 0-534-95262-3. [ bib ] |
| [5] |
J. A. A. Quitzau.
Um consenso completamente resolvido entre árvores filogenéticas
completamente resolvidas.
Master's thesis, Institute of Computing, University of Campinas,
2005. [ bib | .ps ] |
| [6] |
EMBOSS Team.
fdnadist manual, 2004. [ bib | http ] |
| [7] |
J. Felsenstein.
Inferring Phylogenies.
Sinauer Associates, Inc., 2004.
ISBN: 0-87893-177-5. [ bib ] |
| [8] |
Eugene W. Myers, Granger G. Sutton, Art L. Delcher, Ian M. Dew, Dan P. Fasulo,
Michael J. Flanigan, Saul A. Kravitz, Clark M. Mobarry, Knut H. J. Reinert,
Karin A. Remington, Eric L. Anson, Randall A. Bolanos, Hui-Hsien Chou,
Catherine M. Jordan, Aaron L. Halpern, Stefano Lonardi, Ellen M. Beasley,
Rhonda C. Brandon, Lin Chen, Patrick J. Dunn, Zhongwu Lai, Yong Liang,
Deborah R. Nusskern, Ming Zhan, Qing Zhang, Xiangqun Zheng, Gerald M. Rubin,
Mark D. Adams, and J. Craig Venter.
A whole-genome assembly of Drosophila.
Science, 287(5461):2196-2204, March 2000. [ bib | .pdf ] |
| [9] |
M. Chaisson, P. A. Pevzner, and H. Tang.
Fragment assembly with short reads.
Bioinformatics, 20(13):2067-2074, 2004. [ bib | .pdf ] |
| [10] |
J. Meidanis.
Genome rearrangements.
Talk given at Fleury Diagnostic Medicine, Sao Paulo, Brazil, Dec
2004. [ bib | .pdf ] |
| [11] |
C. V. G. Mira and J. Meidanis.
Sorting by block-interchanges and signed reversals.
Submitted for publication, Dec 2005. [ bib | .pdf ] |
| [12] |
J. Meidanis and Z. Dias.
Genome rearrangements distance by fusion, fission, and transposition
is easy.
Technical Report IC-01-07, Institute of Computing, University of
Campinas, July 2001. [ bib | .pdf ] |
| [13] |
D. A. Christie.
Sorting permutations by block-interchanges.
Information Processing Letters, 60:165-169, 1996. [ bib | .pdf ] |
| [14] |
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, Jan 1999. [ bib | .pdf ] |
| [15] |
S. Mneimneh.
Genome rearragement, sorting signed permutations by reversals.
Lectures 16 and 17 of course CSE 8354 - Computational Biology,
Southern Methodist University, Dallas, USA, 2004. [ bib | http ] |
| [16] |
H. Kaplan, R. Shamir, and R. E. Tarjan.
Faster and simpler algorithm for sorting signed permutations by
reversals.
In SODA 1997 - Proceedings of the Eighth Annual ACM-SIAM
Symposium on Discrete Algorithms, pages 344-351. Society for Industrial and
Applied Mathematics, 1997. [ bib | .pdf ] |
| [17] |
A. Bergeron.
A very elementary presentation of the Hannenhalli-Pevzner theory.
Discrete Applied Mathematics, 146:134-145, 2005. [ bib | .pdf ] |
| [18] |
V. Bafna and P. A. Pevzner.
Sorting by transpositions.
SIAM J. Discrete Math., 11(2):224-240, May 1998. [ bib | .pdf ] |
| [19] |
Z. Dias and J. Meidanis.
Sorting by prefix transpositions.
In Proc. of SPIRE'2002 - String Processing and Information
Retrieval Symposium, pages 65-76, 2002. [ bib | .ps ] |
| [20] |
S. Benzer.
On the topology of the genetic fine structure.
Proc. Nat. Acad. Sci. - USA, 45:1607-1620, 1959. [ bib | .pdf ] |
| [21] |
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 ] |
| [22] |
J. Meidanis, O. Porto, and G. P. Telles.
On the consecutive ones property.
Discrete Applied Mathematics, 88:325-354, 1998. [ bib | .pdf ] |
| [23] |
G. P. Telles and J. Meidanis.
Building PQR trees in almost linear time.
Submitted for publication, Aug 2004. [ bib | .ps ] |