mastersthesis(Alme2007)
Almeida, A.A.M.
Comparação Algébrica de Genomas: O Caso da Distância de Reversão
Institute of Computing, University of Campinas, 2007
article(BMY2001)
Bader, D.A., Moret, B.M.E. & Yan, M.
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
Journal of Computational Biology, 2001, Vol. 8(5), pp. 483-491
article(BP1998)
Bafna, V. & Pevzner, P.A.
Sorting by Transpositions
SIAM J. Discrete Math., 1998, Vol. 11(2), pp. 224-240
article(Benz1959)
Benzer, S.
On the Topology of the Genetic Fine Structure
Proc. Nat. Acad. Sci. - USA, 1959, Vol. 45, pp. 1607-1620
article(Berg2005)
Bergeron, A.
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics, 2005, Vol. 146, pp. 134-145
article(BMS2006)
Bergeron, A., Mixtacki, J. & Stoye, J.
On Sorting by Translocations
Journal of Computational Biology, 2006, Vol. 13(2), pp. 567-578
article(BL1976)
Booth, K.S. & Lueker, G.S.
Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity using PQ-Tree Algorithms
J. Comput. Systems Sci., 1976, Vol. 13(3), pp. 335-379
unpublished(C-B2011)
Castells-Brooke, N.
Beginner's guide to molecular biology
2011
article(CPT2004)
Chaisson, M., Pevzner, P.A. & Tang, H.
Fragment assembly with short reads
Bioinformatics, 2004, Vol. 20(13), pp. 2067-2074
article(Chri1996)
Christie, D.A.
Sorting permutations by block-interchanges
Information Processing Letters, 1996, Vol. 60, pp. 165-169
mastersthesis(Dias2002)
Dias, Z.
Rearranjo de genomas: Uma coletânea de artigos
Institute of Computing, University of Campinas, 2002
inproceedings(DM2002b)
Dias, Z. & Meidanis, J.
Sorting by Prefix Transpositions
Laender, A. H. F. & Oliveira, A. L. (ed.)
SPIRE 2002 - Proceedings of the Workshop on String Processing and Information Retrieval
2002, Vol. 2476, pp. 65-76
techreport(DM2002a)
Dias, Z. & Meidanis, J.
The Genome Rearrangement Distance by Fusion, Fission, and Transposition with Arbitrary Weights
Institute of Computing, University of Campinas, 2002(IC-02-01)
article(Dool2000)
Doolittle, R.F.
On the Trail of Protein Sequences
Bioinformatics, 2000, Vol. 16(1), pp. 24-33
article(Eddy2005)
Eddy, S.R.
Antedisciplinary Science
PLoS Comput. Biol., 2005, Vol. 1(1), pp. 3-4
manual(Embo2004)
EMBOSS
fdnadist manual
2004
book(EG2001)
Ewens, W.J. & Grant, G.R.
Statistical Methods in Bioinformatics: An Introduction
Springer-Verlag, 2001
article(FKW1995)
Farach, M., Kannan, S. & Warnow, T.
A Robust Model for Finding Optimal Evolutionary Trees
Algorithmica, 1995, Vol. 13, pp. 155-179
book(Fels2004)
Felsenstein, J.
Inferring Phylogenies
Sinauer Associates, Inc., 2004
mastersthesis(Fort2005)
Fortuna, V.J.
Distâncias de Transposição entre Genomas
Institute of Computing, University of Campinas, 2005
techreport(FM2004)
Fortuna, V.J. & Meidanis, J.
Sorting the Reverse Permutation by Prefix Transpositions
Institute of Computing, University of Campinas, 2004(IC-04-04)
article(GJB+2006)
Goldberg, S.M.D., Johnson, J., Busam, D., Feldbyum, T., Ferreira, S., Friedman, R., Halpern, A., Khouri, H., Kravitz, S.A., Lauro, F.M., Li, K., Rogers, Y.-H., Strausberg, R., Sutton, G., Tallon, L., Thomas, T., Venter, E., Frazier, M. & Venter, J.C.
A Sanger/pyrosequencing hybrid approach for the generation of high-quality draft assemblies of marine microbial genomes
Proc. Nat. Acad. Sci. - USA, 2006, Vol. 103(30), pp. 11240-11245
incollection(GO2005)
Gusfield, D. & Orzack, S.H.
Haplotype Inference
Aluru, S. (ed.)
Handbook of Computational Molecular Biology
Chapter 18
Chapman & Hall/CRC, 2005, Vol. 9
article(HP1999)
Hannenhalli, S. & Pevzner, P.A.
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals
Journal of the ACM, 1999, Vol. 46(1), pp. 1-27
article(HM1999)
Huang, X. & Madan, A.
CAP3: A DNA Sequence Assembly Program
Genome Research, 1999, Vol. 9, pp. 868-877
book(Jacy1974)
Jacy Monteiro, L.H.
Elementos de Algebra
Livros Tecnicos e Cientificos Editora, Rio de Janeiro, 1974
inproceedings(KST1997)
Kaplan, H., Shamir, R. & Tarjan, R.E.
Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SODA 1997 - Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
1997, pp. 344-351
article(MBG2003)
Mclysaght, A., Baldi, P.F. & Gaut, B.S.
Extensive gene gain associated with adaptive evolution of poxviruses
Proceedings of the National Academy of Sciences of the USA, 2003, Vol. 100(26), pp. 15655-15660
incollection(Meid1999)
Meidanis, J.
A Simple Toolkit for DNA Fragment Assembly
Farach-Colton, M., Roberts, F. S., Vingron, M. & Waterman, M. (ed.)
Mathematical Support for Molecular Biology
American Mathematical Society, 1999, Vol. 47, pp. 271-288
inproceedings(Meid2003)
Meidanis, J.
Current Challenges in Bioinformatics
Nascimento, M. A., de Moura, E. S. & Oliveira, A. L. (ed.)
Proc. of SPIRE'2003 - String Processing and Information Retrieval Symposium
Springer, 2003, Vol. 2857, pp. 16-27
unpublished(Meid2004)
Meidanis, J.
Genome Rearrangements
2004
incollection(MD2000)
Meidanis, J. & Dias, Z.
An Alternative Algebraic Formalism for Genome Rearrangements
Sankoff, D. & Nadeau, J. (ed.)
Comparative Genomics
Kluwer Academic Publishers, 2000, pp. 213-223
techreport(MD2001)
Meidanis, J. & Dias, Z.
Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy
Institute of Computing, University of Campinas, 2001(IC-01-07)
article(MPT1998)
Meidanis, J., Porto, O. & Telles, G.P.
On the Consecutive Ones Property
Discrete Applied Mathematics, 1998, Vol. 88, pp. 325-354
inproceedings(MWD1997)
Meidanis, J., Walter, M.E.M.T. & Dias, Z.
Transposition Distance Between a Permutation and Its Reverse
Baeza-Yates, R. (ed.)
WSP 1007 - Proceedings of the Fourth South American Workshop on String Processing
1997, pp. 70-79
article(MWD2002)
Meidanis, J., Walter, M.E.M.T. & Dias, Z.
A Lower Bound on the Reversal and Transposition Diameter
J. of Computational Biology, 2002, Vol. 9, pp. 743-745
unpublished(Mnei2004)
Mneimneh, S.
Genome rearragement, sorting signed permutations by reversals
2004
article(MSD+2000)
Myers, E.W., Sutton, G.G., Delcher, A.L., Dew, I.M., Fasulo, D.P., Flanigan, M.J., Kravitz, S.A., Mobarry, C.M., Reinert, K.H.J., Remington, K.A., Anson, E.L., Bolanos, R.A., Chou, H.-H., Jordan, C.M., Halpern, A.L., Lonardi, S., Beasley, E.M., Brandon, R.C., Chen, L., Dunn, P.J., Lai, Z., Liang, Y., Nusskern, D.R., Zhan, M., Zhang, Q., Zheng, X., Rubin, G.M., Adams, M.D. & Venter, J.C.
A Whole-Genome Assembly of Drosophila
Science, 2000, Vol. 287(5461), pp. 2196-2204
article(Pevz2004)
Pevzner, P.
Educating biologists in the 21st century: bioinformatics scientists versus bioinformatics technicians
Bioinformatics, 2004, Vol. 20(14), pp. 2159-2161
article(PTW2001)
Pevzner, P., Tang, H. & Waterman, M.S.
An Eulerian Path Approach to DNA Fragment Assembly
Proc. Nat. Acad. Sci. - USA, 2001, Vol. 98(17), pp. 9748-9753
mastersthesis(Quit2005)
Quitzau, J.A.A.
Um consenso completamente resolvido entre árvores filogenéticas completamente resolvidas
Institute of Computing, University of Campinas, 2005
article(SY2005)
Salzberg, S.L. & Yorke, J.A.
Beware of Mis-assembled Genomes
Bioinformatics, 2005, Vol. 21(24), pp. 4320-4321
book(SM97)
Setubal, J.C. & Meidanis, J.
Introduction to Computational Molecular Biology
PWS Publishing Company, 1997
unpublished(Sham2001)
Shamir, R.
Pairwise sequence comparison
2001
unpublished(TM2007)
Telles, G.P. & Meidanis, J.
Building PQR Trees in Almost Linear Time
2007
inproceedings(TM2005)
Telles, G.P. & Meidanis, J.
Building PQR trees in almost-linear time
Proceedings of GRACO2005
Elsevier, 2005, Vol. 19, pp. 33-39
article(YAF2005)
Yancopoulos, S., Attie, O. & Friedberg, R.
Efficient sorting of genomic permutations by translocation, inversion and block interchange
Bioinformatics, 2005, Vol. 21(16), pp. 3340-3346
article(ZSSY2008)
Zimin, A.V., Smith, D.R., Sutton, G. & Yorke, J.A.
Assembly Reconciliation
Bioinformatics, 2008, Vol. 24(1), pp. 42-45