- Open Access
Refining borders of genome-rearrangements including repetitions
BMC Genomics volume 17, Article number: 804 (2016)
DNA rearrangement events have been widely studied in comparative genomic for many years. The importance of these events resides not only in the study about relatedness among different species, but also to determine the mechanisms behind evolution. Although there are many methods to identify genome-rearrangements (GR), the refinement of their borders has become a huge challenge. Until now no accepted method exists to achieve accurate fine-tuning: i.e. the notion of breakpoint (BP) is still an open issue, and despite repeated regions are vital to understand evolution they are not taken into account in most of the GR detection and refinement methods.
Methods and results
We propose a method to refine the borders of GR including repeated regions. Instead of removing these repetitions to facilitate computation, we take advantage of them using a consensus alignment sequence of the repeated region in between two blocks. Using the concept of identity vectors for Synteny Blocks (SB) and repetitions, a Finite State Machine is designed to detect transition points in the difference between such vectors. The method does not force the BP to be a region or a point but depends on the alignment transitions within the SBs and repetitions.
The accurate definition of the borders of SB and repeated genomic regions and consequently the detection of BP might help to understand the evolutionary model of species. In this manuscript we present a new proposal for such a refinement. Features of the SBs borders and BPs are different and fit with what is expected. SBs with more diversity in annotations and BPs short and richer in DNA replication and stress response, which are strongly linked with rearrangements.
Large scale genomic rearrangements (LSGR) have been widely studied due to their implication in the evolution of the species. The study of rearrangements is strongly linked with Synteny Blocks (SB) defined as conserved regions between sequences . The regions between SB are called breakpoints (BP), and their study might reveal clues towards evolutionary mechanisms [2, 3]. Both, SB and BP, have been used for phylogeny distance calculation , ancestral genome reconstruction , and others.
Although there are many methods to identify SBs, they usually do not refine their borders [3, 6, 7]. Those methods that refine SBs -and therefore BP- they usually focus on extending the borders of the SB, aiming to maximize a specific target function based on the alignment. Additionally, the lack of a well-accepted definition of SB  might be among the reasons that current tools yield widely different results. Furthermore, the presence of repeated regions or small blocks between the SBs increases the complexity of the detection, one of the main reasons why most methods do not take into account such repetitions. However, these repetitions -mostly associated with mobile elements- have been driving the evolution in many ways .
One of the main problems to identify BPs is the unclear definition. For example, Lemaitre et al.  reasoned that a BP is not a single “point” but a region between two SB; while others, for example Chu et al.  describe a method to determine the exact location of a BP at nucleotide level for inversions and block interchange events.
A second problem appears when trying to refine the SB by extending its borders. Current methods try to maximize the alignment in the region between two SBs, but boundaries are less conserved. Most of them [12–14], remove the small blocks or repetitions to simplify the SB detection. Clearly the resulting BPs might be contaminated by small subsequences which actually have a homologous region in the other sequence. Any analysis based on these contaminated sequences will be biased by these small subsequences.
In a recent work  we addressed the detection of blocks of large rearrangements, called Computational Synteny Blocks, taking into account repetitions. In this manuscript, we propose a method to refine these detected CSBs and detect also BPs taking into account small blocks and any kind of repetitions. Indeed, we use the repetitions alignment to improve the accuracy of the refinement process. In our model, we contemplate inversions, duplications and translocations.
Our results show a higher accuracy in terms of percentage of identity in refined SBs. Our results also indicate biological differences between refined SBs and detected BPs sequences. Sequences in the SBs borders are richer in DNA damage whereas sequences in the detected BPs are richer in DNA replication and stress response, strongly linked to evolution .
Our method starts with the collection of Computational Synteny Blocks (CSB) - similar to SB associated with coding regions, and CSB also covering non-coding regions. The CSBs are calculated using GECKO-CSB  (second step in Fig. 1). Applying linearity and collinearity functions (described in ) over the CSB provided by GECKO-CSB we identify LSGR (so far duplications, inversions and translocations). The next step — which is reported in this document- is the precise refinement of the borders of CSBs involved in every detected LSGR (third step in Fig. 1). This refinement is applied to the sequences involved in calculation (namely sequences X and Y) in two independent and separable processes. After that we combine the results to get the final refinement. Figure 1 describes the workflow step by step.
Once an LSGR is detected, we take the two CSBs involved. The repetitions in between them, if any, are also take into account. Then we define a region of interest (ROI) running from the tail of one CSB to the head of the other (step 4 in Fig. 1). This ROI includes an arbitrary offset to force the overlapping between CSBs and repetitions (see Figs. 2 and 12). A virtual CSB (C S B V ) and virtual repetitions are created by extending the borders in order to cover the ROI. Afterwards, these C S B V and virtual repetitions are aligned using a fast customized implementation of the Needleman and Wunsch  global alignment method. The main idea of this process is to force overlapped regions to study the alignments within the ROI.
At this point an identity vector for every aligned C S B V and all repetitions is computed (step 5 in Fig. 1. See Additional file 1 for more details). Then, a “difference vector” (V diff ) is calculated (step 7). If we are working with only two C S B V , the V diff contains the normalized absolute difference between the two identity vectors. If besides that we are working with repetitions, we compute the V diff taking into account a consensus identity vector from the repetitions (step 6).
The rationale behind the method is the following: The V diff vector contains high values when identity vectors are different. In those regions where values are similar in both identity vectors, the values contained in V diff will be low. At some point we will observe a transition between high and low values along the V diff vector. These transitions will define the BP. A finite-state machine (FSM) was designed to detect these transitions (step 8). At the end of the process, CSB borders are refined based on the BPs detected by the FSM. The method does not force the BP to be a region or a point. This will depend on the transition’s features.
Detection of CSBs repetitions and large-scale genomic rearrangements
CSBs and repetitions are detected using Gecko-CSB , an extension of Gecko . This software has demonstrated its capacity to yield HSPs of high-quality beating reference software. In  we presented a set of formal definitions describing different levels of linearity and collinearity between CSBs. Using these definitions, a set of rules was defined to identify LSGR in single chromosome species, such a inversions, translocations, reverted translocations and duplications. Once a LSGR is detected, we perform our refining method over those CSBs involved in the LSGR.
After the detection of a LSGR two CSBs (namely A and B) are selected. Optionally, if collinearity between CSB A and CSB B is interrupted by a set of repeats, the repeats will be included in the selection as well. Repeats can be separated in two groups. Those repeats whose coordinates in the sequence X overlap with CSBs A and B are grouped in a collection named repeats-X. In the collection repeats-Y are the equivalents regarding sequence Y.
At this point the method splits in two branches. The refinement in the sequence X and Y are complementary and independent. In this document we will describe the refinement for the sequence X branch. The sequence Y branch is the same, but interchanging X by Y.
Calculating the region of interest
The CSBs and repeats define a ROI (see Eq. 5, Figs. 2 and 12). Since our method is focused on finding transitions between CSBs and repetitions, we introduce an offset parameter, which ensures overlapping between the end of CSBs and the beginning of virtual CSBs and the virtual repetitions, guaranteeing that transitions are present. In the worst case, the method will have offset number of nucleotides in both CSBs that share similarity and therefore, they can be aligned with a high value of identity. In other words, the offset parameter stabilises the beginning and the end of the signal (More details in “FSM thresholds selection” in the Additional file 1). The ROI is defined as follows:
After calculating the ROI, new CSBs named virtual CSBs (C S B V ) are created using the ROI X Start and X End coordinates. This means that all C S B V s will start and end at the same point. In this step we are extending or trimming the old CSBs concerning ROI start and end points. New C S B V s’ Y coordinates will be calculated depending on how much we have trimmed or extended the coordinates in X regarding the old CSB. The equations that describe this process are the following:
Notice that α takes negative values when trimming and positive when extending. New C S B V s are aligned using a Needledman and Wunsch implementation.
Calculating identity vectors
After the alignment of C S B V s, identity vectors (I V ) are created for every C S B V . All I V s have the same length and they represent the percentage of identity that a certain region of length W has in the alignment. We take a window of length W to calculate that percentage of identity.
First we create a binary vector (V B ) which represents matches in the alignment. V B has the length of the alignment. Since V B takes into account gaps, its length can be different from one C S B V to another. By using a window of length W, we can compute the percentage of identity at any point in V B . As long as we are going to compare I V from different C S B V s, identity values from those points in the alignment that represent a gap in sequence X are not stored. This way, all identity vectors from different C S B V s will have the same length, R O I length .
Low values in parameter W produce a noisy identity vector corresponding with high frequency changes of identity. On the contrary, high values in parameter W smooth the noise and produce a low frequency signal. The selection of a proper W value is not possible as it might change depending on the C S B V involved. We could also be interested on changes that happen at different frequencies. Therefore, instead of choosing a fixed W value, which would mean changes at only one frequency, we build a vector containing all frequencies as follows:
where A i is the weight of the identity vector at a certain frequency
And the Identity vector at a certain frequency is calculated as follows:
In this model, N defines the maximum window to compute the percentage of identity and also defines the start and end positions where the values of the vector can be used. From 0 to 2N+1 and from 2N+1−R O I length to R O I length the I V is uncompleted. Therefore, N cannot be as long as we want. It should be at least lesser than OFFSET. In practice we have observed that a value of 50 is enough to get good results.
Finally, since identity vectors are going to be compared, they must to be normalized.
Calculating consensus identity vector
In the case that a group of repetitions are detected, we use the information of the consensus sequence to improve accuracy of the refinement method.
After repeats have been aligned and the V B s have been computed, a Sum Match Vector (V SM ) is calculated by adding all V B s vectors. This vector has a length of R O I length , so only positions which are not representing a gap are taken into account -as we did in the previous section. Then, we calculate the percentage of repeats that cover one specific position in the V SM . To calculate the Consensus Identity Vector (V CI ), only positions that comply with a given threshold are set to 1, and 0 otherwise. In this implementation the threshold was set to 25 %. This new vector is named Consensus Binary Vector. After this process, we calculate the V CI by processing the Consensus Binary Vector as we already described in the previous section.
In order to detect transitions which delimitate the BP, we compute the absolute difference between the C S B V s identity vector. C S B V s are extracted from CSBs according to the ROI, using the OFFSET to ensure that similar regions are represented in C S B V s. As a result, the identity vectors for the C S B V -A have a high value at the beginning and low value at the end. On the contrary, the identity vectors for the C S B V -B have a low value at the beginning and high value at the end. This is the reason why the vector difference will start and end with high values. If repetitions are detected, then the difference vector will have high values in the middle as well.
Anyways, transitions will be found in between these high values (see Fig. 2).
Detecting transition points
To detect transitions a Finite-State Machine (FSM) was designed. Figure 3 shows the design. Basically, the FSM detects the coordinates where the vector difference value was the last time at a certain threshold (U1) before reaching the second threshold (U2). As a result, the selected region defined by the coordinates is the transition between high and low values along the vector difference.
We associate these transitions as a candidate for a BP. After this process, the refined SB can be trimmed or extended. The threshold selection is discussed in the next section.
We will use a simple case to illustrate the algorithm behaviour in the SB borders-refinement method using M. hyorhinis HUB-1 (Accession code NC-014448.1) and M. hyorhinis SK76 (Accession code NC-019552.1) genome sequences with a length of 839,615 bp and 836,897 bp, respectively.
Table 1 shows the coordinates of the CSBs involved in the inversion before and after the refinement process, where X represents M. hyorhinis HUB-1 and Y correspond to M. hyorhinis SK76. Str. column represents the strand of the Y sequence, forward or reverse. The percentage of extension in X and Y sequence is shown in Δ X and Δ Y columns.
The percentage of identities has increased a bit due to the extension (the refined CSBs are a bit longer). Notice that in C S B 2 the refine process has extend the Y Start coordinate making the CSBs 7 nucleotides shorter. On the other hand, in the opposite border (y End ) it has extended 29 nucleotides.
Four regions have been detected as repeated sequences. A database search (Uniprot bacteria at ftp://ftp.ebi.ac.uk) using SMA3s  was carried out. Results and sequence features are shown in Table 2.
And the BPs are shown in the Table 3.
In this case the method has found 8 BPs. Due to repetitions that the method detects between two CSBs, two BPs are detected in each sequence. For each BP found, we have performed a database search using Uniprot and NCBI non-redundant with no results. No annotation was found.
Comparing with CASSIS software
We have processed the CSBs detected by GECKO-CSB using CASSIS  in order to refine them. Since CASSIS cannot handle repetitions and following the recommendations from its article, we have masked all the repetitions in both sequences using RepeatMasker  (search Engine was abblast) and we did not include the repetitions in the input file. Data set and results can be found in the Additional file 1.
Results from CASSIS are widely different than those obtained by our method because, among other reasons, they do not take into account repetitions. Our method detects 2 short BPs where CASSIS detects a big one. Indeed, BP 3b and 4b (SK76 sequence) cover the region contained by CSBs 1, 2 and 3. This result is incomprehensible because it implies that the SBs desapear, creating a huge BP of size around 85 Kbps, instead of these 3 SBs.
BP 1b has a length of 1,608 bps. We have performed a BLAST  search using the sequence of BP 1b with default parameters. The sequence has been found several times in different sub species of hyorhinis with high values of identity and coverage, which point-out that this sequence is a part of a conserved repetition (see BLAST Report-BreakPoint-1b in Additional file 1). An additionally BLAST search was carried out using sequences from BP 2a with similar results.
We have performed a database search using SMA3s over the BP detected by CASSIS. Results are shown in Table 4 (description and enzyme columns).
Testing the method with a 68 mycoplasmas dataset
For the next test, a collection of 68 Mycoplasmas was used. This test was performed with the aim to avoid bias in the analysis that a selection of two particular genomes could introduce. The genome collection and their gene bank annotations are available at http://bitlab-es.com/gecko/. For the biological analysis we have performed SMA3s  over the sequences to find annotations using the Uniprot bacteria database (ftp://ftp.ebi.ac.uk). Additionally blast2GO  was used to carry out a second annotation process using blastx and the non-redundant protein database filtered by Bacteria taxa.
Our method refined 2,213 CSBs, 829 were trimmed after the refining process and 1,384 were extended. Around 70 % of the BPs detected are sized below 100 bps, 95 % below 300 bps (see Fig. 5). The BP detection was limited in the implementation at a size of 5000 bps to avoid spurious long BPs. As it can be observed in Fig. 6, the frequency of the length tends to zero at length of around 400 bps.
To analyse the results from a biological point of view, BPs sequences were extracted. The sequences of the proportional region of the adjacent Synteny Block (PRASB) of each BP were also extracted according with the BP length (the length of the PRASB sequence has the same length of the BP sequence, see Fig. 12). The purpose was to find biological differences by comparing results from annotations in BP and PRASB sequences. The sequences were compared against the NCBI non-redundant protein database, filtered by Bacteria taxa. After that, the sequences were mapped and annotated using blast2GO .
The number of sequences with annotation was higher in BPs (32 %) than in PRASBs (26 %). For more details, see Fig. 7. We also analysed the percentage of annotations by level of coverage that cover the CSBs in the comparison from which the BPs were detected. We found that at a lower level of coverage (meaning non related species), more sequences were annotated, especially in BPs sequences (27 % vs 17 %, see Fig. 8).
Regarding the content of the annotation, we found several differences in the biological process and molecular function categories. Figure 9 shows a summary of the biological process category with the most significant differences between BPs sequences and PRASBs sequences. SOS response, DNA integration or metabolic process were more present in PRASB sequences. Proteolysis, response to heat, protein folding, DNA topological change and DNA replication were found in more proportion in BP sequences. Full reports are available as Additional file.
We also performed another database search, which was carried out using SMA3s  against the UNIPROT database. The results showed strong differences between annotations in BPs and PRASBs sequences. Figure 10 shows the UNIPROT keyword categories for Biological process. Stress response and DNA replication are more present in BP sequences. On the other hand, Glycolysis, Calvin cycle and DNA damage are significantly more present in the PRASB than in BP sequences.
Figure 11 shows the UNIPROT pathways. Carbohydrate degradation is by far more represented in PRASB sequences and Purine metabolism is more present in BP sequences. Full reports are available as Additional file.
The method we present in this manuscript detects two BPs when refining SBs, one at each border (tail or head) of the SB, instead of considering the whole region between these SBs as one large BP. Therefore, after the refining process we have two BPs and one region in between (gap), as it can be observed in the Fig. 12. The sequences corresponding with this region in between the BPs were extracted to be analysed.
Around 30 % of the gap regions in between two breakpoints are shorter than 100 bps of length, 88 % below 1,000 bps.
In order to analyse biological differences between BPs and the gap between two BPs once SBs borders have been refined, we have extracted the sequences corresponding with the gap regions between BPs.
A SMA3s search was carried out over BPs sequences and the gap sequences using the Uniprot database. The main difference according with these results is at the biological process (Fig. 13). DNA replication, Stress response and Purine salvage were found more often in the gap whereas transport, DNA damage and DNA excision were more present in the BP sequences.
The break point definition
A SB is defined as a relation between two conserved regions in the sequence of two different species, in terms of homology or similarity. A BP is usually known as the region in between two SBs that have suffered a rearrangement due to a LSGR. Many studies support that LSGR do not happen randomly but follow an unknown model. Some regions of the sequence seem to be more fragile or predispose to suffer a large-scale LSGR . Indeed these BPs can be reused [3, 23] and the BP reuse rate is strongly linked with the resolution in which SB are detected .
Therefore, if a BP depends on the “fragility” of the specific regions in the sequence then it should not be defined as a relation between two specific regions of two sequences (as SB is defined). Although so far a comparison method is needed to detect them.
Current methods based on sequence comparison, detect SBs by joining or chaining High Score Segment Pairs, and when they refine their borders, they try to expand the SB borders by maximizing a target score function. This means that the BP region will be a region without similarity. However, following the previous reasoning about BP definition, it implies that BPs regions do not have to be necessarily regions with almost no similarity. Two species could share the same BP and therefore, the sequences would have some level of similarity. We think that when refining SBs, they can be trimmed as well as expanded after the refinement process.
Threshold selection in the finite state machine
Our method bases the BP detection on transition points in the differences of the percentage of identities. We have analysed the behaviour of the identity vector along SBs. We have found that coding regions and non-coding regions have different levels of identity, which can be explained because of different evolutionary level of pressure. But we also have found that in many cases there is a perceptible transition that could be detectable using a FSM (see Fig. 14). We think that something similar might happen between SBs and BPs, a detectable transition that could determine the BP region.
To identify these transitions we have designed a FSM which uses two thresholds. In the current version of the implementation of the method, which we have described in this document, thresholds are set to 80 and 20 respectively. The selection of the parameter values was made empirically. (see “FSM thresholds selection” in the Additional file 1 for more details).
We analysed the identity percentage of SBs and BPs at different length and have found a strong correlation between SB and BP levels of identity percentage (see Fig. 15). In general BPs have less identity percentage than SB.
We have developed a method to refine the borders of CSBs taking into account repetitions and using them to improve the accuracy of the refinement. The method is not based on maximizing any target function, but studies the alignments to refine and uses a finite-state machine to find transition points in the alignment. These transition points set an accurate refinement of the involved blocks. Due to the method’s features, BPs are detected as regions or as points, depending on the specific case. It also takes into account the repeated regions, so between two CSBs it can give 4 breakpoints, 2 for each sequence, demarcating start/end of one block and end/start of the region in between.
Several analysis were carried out in order to find biological differences between BPs, SBs borders and gap regions.
The results showed that there are biological differences between BPs sequences and the PRASB sequences. BPs sequences are biologically richer than PRASB. Both searches using Uniprot and NCBI databases gave more results in BPs sequences than the PRASB sequences. However, PRASB showed more diversity in annotations than those obtained for BPs.
Our experiments show that there may to be a correlation between the number of sequences annotated in BPs and PRASB and the relatedness of the species from which those sequences were extracted.
We have also found that there are differences between what we consider as BPs and the region in between the BPs, whereas other methods just consider the whole region as BP.
Our method needs two thresholds to detect the transition points in the difference vector in which the BP is defined. Thresholds pick up the abrupt changes in the signal. These thresholds are fixed in this version of the method, however, we will work on a dynamic configuration of the threshold based on SB similarity that might produce more accurate results.
Nadeau JH, Taylor Ba. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc Natl Acad Sci U S A. 1984; 81(February):814–8. doi:http://dx.doi.org/10.1073/pnas.81.3.814.
Bailey Ja, Baertsch R, Kent WJ, Haussler D, Eichler EE. Hotspots of mammalian chromosomal evolution. Genome Biol. 2004; 5(4):23. doi:http://dx.doi.org/10.1186/gb-2004-5-4-r23.
Pevzner P, Tesler G. Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse. Genome Res. 2003; 13(1):37–45. doi:http://dx.doi.org/10.1101/gr.757503.
Blanchette M, Bourque G, Sankoff D. Breakpoint Phylogenies. Genome Inform Ser Workshop Genome Inform. 1997; 8:25–34.
Alekseyev M, Pevzner P. Breakpoint graphs and ancestral genome reconstructions. Genome Res. 2009; 2000:943–57. doi:http://dx.doi.org/10.1101/gr.082784.108.2.
Darling AE, Mau B, Perna NT. Progressivemauve: Multiple genome alignment with gene gain, loss and rearrangement. PLoS ONE. 2010;5(6). doi:http://dx.doi.org/10.1371/journal.pone.0011147.
Donthu R, Lewin HA, Larkin DM. SyntenyTracker: a tool for defining homologous synteny blocks using radiation hybrid maps and whole-genome sequence. BMC Res Notes. 2009; 2(1):148. doi:http://dx.doi.org/10.1186/1756-0500-2-148.
Ghiurcuta CG, Moret BME. Evaluating synteny for improved comparative studies. Bioinformatics. 2014; 30:9–18. doi:http://dx.doi.org/10.1093/bioinformatics/btu259.
Kazazian HH. Mobile elements: drivers of genome evolution. Science (New York). 2004; 303(5664):1626–1632. doi:http://dx.doi.org/10.1126/science.1089670.
Lemaitre C, Tannier E, Gautier C, Sagot MF. Precise detection of rearrangement breakpoints in mammalian chromosomes. BMC Bioinforma. 2008; 9:286. doi:http://dx.doi.org/10.1186/1471-2105-9-286.
Chu TC, Liu T, Lee DT, Lee GC, Shih ACC. GR-Aligner: An algorithm for aligning pairwise genomic sequences containing rearrangement events. Bioinformatics. 2009; 25(17):2188–193. doi:http://dx.doi.org/10.1093/bioinformatics/btp372.
Baudet C, Lemaitre C, Dias Z, Gautier C, Tannier E, Sagot MF. Cassis: Detection of genomic rearrangement breakpoints. Bioinformatics. 2010; 26(15):1897–1898. doi:http://dx.doi.org/10.1093/bioinformatics/btq301.
Brudno M, Malde S, Poliakov A, Do CB, Couronne O, Dubchak I, Batzoglou S. Glocal alignment: Finding rearrangements during alignment. Bioinformatics. 2003;19(1). doi:http://dx.doi.org/10.1093/bioinformatics/btg1005.
Darling AE, Mau B, Blattner FR, Perna NT. GRIL: Genome rearrangement and inversion locator. Bioinformatics. 2004; 20(1):122–4. doi:http://dx.doi.org/10.1093/bioinformatics/btg378.
Arjona-Medina JA, Trelles O. Computational Synteny Block: A Framework to Identify Evolutionary Events. IEEE Trans NanoBioscience. 2016; 15(4):1–11. doi:http://dx.doi.org/10.1109/TNB.2016.2554150.
Rocha EPC, Matic I, Taddei F. Over-representation of repeats in stress response genes: a strategy to increase versatility under stressful conditions?Nucleic Acids Res. 2002; 30(9):1886–94.
Needleman SB, Wunsch CD. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol. 1970; 48(3):443–53.
Torreno O, Trelles O. Breaking the computational barriers of pairwise genome comparison. BMC Bioinforma. 2015; 16(1):250. doi:http://dx.doi.org/10.1186/s12859-015-0679-9.
Muñoz-Mérida A, Viguera E, Claros MG, Trelles O, Pérez-Pulido AJ. Sma3s: A Three-Step Modular Annotator for Large Sequence Datasets. DNA research: an international journal for rapid publication of reports on genes and genomes (February): 2014. p. 1–13. doi:http://dx.doi.org/10.1093/dnares/dsu001.
Smith CD, Edgar RC, Yandell MD, Smith DR, Celniker SE, Myers EW, Karpen GH. Improved repeat identification and masking in Dipterans. Gene. 2007; 389(1):1–9. doi:http://dx.doi.org/10.1016/j.gene.2006.09.011.
Bedell J, Korf I, Yandell M. Blast.Bioinformatics; 2003, p. 312.
Conesa A, Götz S, García-Gómez JM, Terol J, Talón M, Robles M. Blast2GO: A universal tool for annotation, visualization and analysis in functional genomics research. Bioinformatics. 2005; 21(18):3674–676. doi:http://dx.doi.org/10.1093/bioinformatics/bti610.
Sankoff D, Trinh P. Chromosomal Breakpoint Reuse in Genome Sequence Rearrangement. J Comput Biol. 2005; 12(6):812–21. doi:http://dx.doi.org/10.1089/cmb.2005.12.812.
Attie O, Darling AE, Yancopoulos S. The rise and fall of breakpoint reuse depending on genome resolution. BMC Bioinforma. 2011; 12(Suppl 9):1. doi:http://dx.doi.org/10.1186/1471-2105-12-S9-S1.
Oscar Torreño Tirado, Michael Krieger and Paul Heinzlreiter for their valuable comments and review.
This article has been published as part of BMC Genomics Volume 17 Supplement 8: Selected articles from the Sixth International Conference of the Iberoamerican Society for Bioinformatics on Bioinformatics and Computational Biology for Innovative Genomics. The full contents of the supplement are available online at https://bmcgenomics.biomedcentral.com/articles/supplements/volume-17-supplement-8.
This work has been partially supported by ISCIII, projects: PT13.001.012 and RD12.013.006) and the EU Mr.SBM project, code 324554. The latter EU project funds the publication fees of this work.
Availability of data and materials
The datasets, software, additional files and results can be found at http://www.bitlab-es.com/geckoat subsection GECKO-CSB. The EBI Uniprot Bacteria database used in this work is available at ftp://ftp.ebi.ac.uk.
JAM contributed in the conception of the work and software development. OT supervised the work and provided ideas. All authors contributed to the manuscript’s preparation. Both authors read and approved the final manuscript.
The authors declare that they have no competing interests.
Consent for publication
Ethics approval and consent to participate
About this article
Cite this article
Arjona-Medina, J., Trelles, O. Refining borders of genome-rearrangements including repetitions. BMC Genomics 17 (Suppl 8), 804 (2016). https://doi.org/10.1186/s12864-016-3069-4
- Synteny block
- Computational synteny block