An algorithm that builds a set of strings given its overlap graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 52-63

  Braga, Marília D V ^a   Meidanis, João ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; POLYNOMIAL APPROXIMATION;

DIRECTED EDGES; DNA FRAGMENT ASSEMBLIES; EXPONENTIAL TIME; FINITE ALPHABET; MAXIMUM DEGREE; NP-HARDNESS; OVERLAP GRAPH; POLYNOMIAL-TIME;

DIRECTED GRAPHS;

EID: 84901424363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_10     Document Type: Conference Paper

References (6)

1. M. D. V. Braga. Grafos de Seqüências de DNA. Master’s thesis, Instituto de Computação, UNICAMP, Campinas, SP, November 2000. In Portuguese at http://www.ic.unicamp.br/~meidanis/research/fa.html.
2. R. Diestel. Graph Theory. Springer-Verlag New York, Inc, 1997.
3. C. E. Ferreira, C. C. de Souza, and Y. Wakabayashi. Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics, 2001. To appear.
4. D. Gusfield, G. M. Landau, and B. Schieber. An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters, 41(4):181–185, March 1992.
5. A. Schrijver. Bipartite edge coloring in O(Δm) time. SIAM Journal on Computing, 28(3):841–846, 1998.
6. J. C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.