|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorigincomment.Palindrome1
origincomment.Palindrome1cible
public class Palindrome1cible
This define palindromes of the target sequence (sometimes from test ?). some parts of the algorithms here... Incompatibility much choices and one choice are similar but do not return the same thing...
ADN1cible
,
traitement_Incompatibilite(Palindrome1cible[], boolean, double, int, int)
,
incompatibilite_plusieurs_choix(Vector, int, int, int, double, boolean, int)
,
incompatibilite_un_choix(Palindrome1cible[], int, int)
Field Summary | |
---|---|
private int[] |
carac_max
"Public attribute" Maximum character ? |
private int[] |
carac_min
"Public attribute" Minimum character ? |
private int |
conservation
"Public attribute" "Number of tests sequences where palindrome is maintained" |
private boolean |
indeci
"Internal attributes" "Undecided" (default is false). |
static int |
LONG_MUT
"Internal attributes" Mutation length is 2. |
private double |
longMut
"Public attribute" Mutation length (default is 0). |
private int |
longueur
"Public attribute" "length of the palindrome in target sequence, which is maintained in test sequences" |
private int |
longueurReelle
"Public attribute" "Length of palindrome in target sequence" |
private int |
nombre_palindromes
"Public attribute" Number of represented palindromes. |
private int |
nombreErreur
"Public attribute" Number of errors. |
private int |
nombreMutationDouble
"Public attribute" Number of double mutations. |
private int |
nombreMutationSimple
"Public attribute" Number of single mutations. |
private double |
pertinence
"Public attribute" Relevance (default is 1.0). |
private double |
poidsequence
"Public attribute" Sequence weight. |
private double |
pourcentage_conservation
"Internal attributes" Conservation rate / percentage (default is 1). |
static int |
TAUX_MUT
"Internal attributes" Mutation rate is 1. |
private double |
tauxMut
"Public attribute" Mutation rate (default is 0). |
private int |
typeCritere
"Public attribute" Criterion type (default is TAUX_MUT). |
Fields inherited from class origincomment.Palindrome1 |
---|
positionDebut, positionFin |
Constructor Summary | |
---|---|
Palindrome1cible()
Default constructor : nothing happend. |
|
Palindrome1cible(int debut,
int fin,
int longueur)
Constrcutor with given begin, end and length. |
|
Palindrome1cible(int debut,
int fin,
int longueur,
int type_critere)
Constructor with given begin, end, length and criterion. |
|
Palindrome1cible(int debut,
int fin,
int longueur,
int nbMutDoub,
int nbMutSimp)
Constructor with given begin, end, length and number of mutations. |
Method Summary | |
---|---|
void |
changer_carac_max(int quelle_carac,
int nv_carac)
|
void |
changer_carac_min(int quelle_carac,
int nv_carac)
|
void |
changer_conservation(int conservation)
|
void |
changer_indeci(boolean b)
|
void |
changer_longMut(double nv)
|
void |
changer_longueur_Reelle(int longueur)
|
void |
changer_longueur(int longueur)
|
void |
changer_nb_pal(int nv)
|
void |
changer_nombre_erreur(int nberrreur)
|
void |
changer_nombre_mutation_double(int nbMutDouble)
|
void |
changer_nombre_mutation_simple(int nbMutSimple)
|
void |
changer_pertinence(double nv)
|
void |
changer_poid_sequence(double score)
|
void |
changer_pourcentage_conservation(double nv)
|
void |
changer_tauxMut(double nv)
|
void |
changer_type_critere(int nvcritere)
|
boolean |
chevauchant(Palindrome1cible p)
"Following methods sorted by use order in ADN1 Class". (17) "to know if two palindrome are crossed together" |
Palindrome1cible |
copie()
To get a clone of the current instance of Palindrome1cible. |
private boolean |
egaux(Palindrome1cible p)
"Following methods sorted by use order in ADN1 Class". (14') "equals method" |
java.util.Vector |
en_appariements(java.util.Vector appariements)
"Following methods sorted by use order in ADN1 Class". (10) "This method return a Vector of pairwise from a palindrome" Current instance is computed to add pairwises in Vector. |
int[][] |
en_paire_de_bases(Palindrome1cible[] tabPal)
Deprecated. because calling procedure is deprecated... |
private static boolean |
est_Compatible(Palindrome1cible pal1,
Palindrome1cible pal2)
"Following methods sorted by use order in ADN1 Class". (5) "To know if two palindromes are compatibles" After reading the code, not sure that fully correct... |
boolean |
est_indeci()
|
static Palindrome1cible[] |
fusion_Palindrome(Palindrome1cible[] tabPalCourant,
Palindrome1cible[] tabPalPrincipal)
"Following methods sorted by use order in ADN1 Class". (6) "Fusion method of two tables of palindromes to have the final table of result step by step ; used by palindromes' search" |
boolean |
inclu_dans(Palindrome1cible p)
"Following methods sorted by use order in ADN1 Class". (16) "this method to know if current instance is included in argument with common pairwise " |
static void |
incompatibilite_plusieurs_choix(java.util.Vector listeTabPal,
int pos_tab,
int i,
int j,
double incertitude,
boolean plusieurs_resultats,
int nb_prediction_max)
"Following methods sorted by use order in ADN1 Class". (2) Much choices to treat incompatibility. |
static Palindrome1cible[] |
incompatibilite_un_choix(Palindrome1cible[] tabPalCibleTrier,
int i,
int j)
"Following methods sorted by use order in ADN1 Class". (3) One choice in incompatibility to structure. |
void |
load_File(java.io.BufferedReader entree)
"Following methods sorted by use order in ADN1 Class". (13) "This method create an _object_ (palindrome tab) from data in a file |
int |
nombre_erreur()
|
int |
nombre_mutation_double()
|
int |
nombre_mutation_simple()
|
int |
nombre_sequence_conserve()
|
double |
quel_critere()
By default (TAUX_MUT) : replace by calling quel_tauxMut() or equivalent. |
double |
quel_longMut()
|
int |
quel_nb_pal()
|
double |
quel_poid_sequence()
|
double |
quel_pourcentage_conservation()
|
double |
quel_tauxMut()
|
int |
quel_type_critere()
|
int |
quelle_carac_max(int i)
|
int |
quelle_carac_min(int i)
|
int |
quelle_longueur_reelle()
|
int |
quelle_longueur()
|
double |
quelle_pertinence()
|
int |
rechercher_approx(java.util.Vector tabPal)
"Following methods sorted by use order in ADN1 Class". (15) "to find an approximate palindrome in a vector of palindromes." |
int |
rechercher(java.util.Vector tabPal)
"Following methods sorted by use order in ADN1 Class". (14) "to find a palindrome in a Vector of palindromes" |
int |
score(Palindrome1cible pal2)
Deprecated. [not used] |
void |
to_File(java.io.PrintWriter sortie)
"Following methods sorted by use order in ADN1 Class". (12) Add the "real length" to the file. |
java.lang.String |
toString_web()
Some changes to this procedure to make results appears for web / HTML. |
java.lang.String |
toString()
"This method to permit show of characteristiks of each palindromeof sequence |
static java.util.Vector |
traitement_Incompatibilite(Palindrome1cible[] tabPalCible,
boolean plusieurs_resultats,
double incertitude,
int nb_prediction,
int nb_prediction_max)
"Following methods sorted by use order in ADN1 Class". (1) "This method is about incompatibility between palindromes of same sequence, sorting palindromes by relevance (single and double mutations) then removing every palindrome incompatible with previous more relevant. |
private static Palindrome1cible[] |
trier_Palindrome_Comp(Palindrome1cible[] tabPal)
"Following methods sorted by use order in ADN1 Class". (4) "This method sort palindromes found at step i of target sequence from their relevance This method is used by the method that search compatible palindromes |
Palindrome1cible[] |
trier_Palindrome_Debut(Palindrome1cible[] tabPal)
"Following methods sorted by use order in ADN1 Class". (8) "This method sort a table of palindromes by the begin position" |
Palindrome1cible[] |
trier_Palindrome_Fin(Palindrome1cible[] tabPal)
"Following methods sorted by use order in ADN1 Class". (7) "This method sort a table of palindromes by the end position" |
static Palindrome1cible[] |
vec_to_tab(java.util.Vector vec)
"Following methods sorted by use order in ADN1 Class". (18) "transform a vector of palindromes to a vector of palindroms" |
Methods inherited from class origincomment.Palindrome1 |
---|
change_position_debut, change_position_fin, quelle_position_debut, quelle_position_fin |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
private int longueur
private int longueurReelle
private int nombreMutationDouble
private int nombreMutationSimple
private int nombreErreur
private int conservation
private double poidsequence
private double tauxMut
private double longMut
private int typeCritere
TAUX_MUT
private double pertinence
private int nombre_palindromes
private int[] carac_max
private int[] carac_min
private double pourcentage_conservation
private boolean indeci
public static final int TAUX_MUT
public static final int LONG_MUT
Constructor Detail |
---|
public Palindrome1cible()
ADN1cible.load_File(BufferedReader)
,
TestAln.main(String[])
,
Interface12.setInterface(Profil, String, Palindrome1cible, int)
public Palindrome1cible(int debut, int fin, int longueur)
debut
- (int) beginfin
- (int) endlongueur
- (int) lengthInterface11.actionPerformed(java.awt.event.ActionEvent)
,
Interface11.initialiser()
,
Interface11.palindrome
,
Interface5.setInterface(ADN1cible, ADN1test[], int, int, int, int, int)
,
Interface12.setInterface(Profil, String, Palindrome1cible, int)
,
ProcessusOrigin.computing(Vector, ADN1cible, boolean, boolean)
,
OriginAlgorithmsStefan.computing(Vector, ADN1cible, boolean, boolean)
,
ADN1cible.comparaison_palindrome(Palindrome1cible[], Palindrome1cible[])
,
ADN1cible.comparaison(ADN1cible, ADN1cible)
,
ADN1cible.palindromes_communs(Palindrome1cible[], Palindrome1cible[], boolean)
,
ADN1cible.recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
ADN1cible.resultat_commun(Vector)
,
ADN1test.distance(ADN1cible, ADN1test, ADN1test[])
,
ArbrePalindrome.tous_les_palindromes()
,
fusion_Palindrome(Palindrome1cible[], Palindrome1cible[])
,
incompatibilite_un_choix(Palindrome1cible[], int, int)
,
trier_Palindrome_Debut(Palindrome1cible[])
public Palindrome1cible(int debut, int fin, int longueur, int type_critere)
debut
- (int) beginfin
- (int) endlongueur
- (int) lengthtype_critere
- (int) criterionADN1cible.diviser_regner(Palindrome1cible[], ADN1cible, ADN1test[], int, int, int, int, boolean, int)
,
ADN1cible.pourcentage_Mutation(ADN1test[], int, boolean)
,
ADN1cible.recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
ADN1cible.recherche_Pseudonoeud(Base[], ADN1test[], boolean, int, int)
public Palindrome1cible(int debut, int fin, int longueur, int nbMutDoub, int nbMutSimp)
debut
- (int) beginfin
- (int) endlongueur
- (int) lengthnbMutDoub
- (int) number of double mutationsnbMutSimp
- (int) number of single mutationscopie()
,
trier_Palindrome_Comp(Palindrome1cible[])
Method Detail |
---|
public int quelle_longueur()
public int quelle_longueur_reelle()
public double quel_poid_sequence()
public int nombre_mutation_simple()
public int nombre_mutation_double()
public int nombre_erreur()
public int nombre_sequence_conserve()
public double quel_tauxMut()
public double quel_longMut()
public double quel_critere()
public double quelle_pertinence()
public int quel_type_critere()
public boolean est_indeci()
public double quel_pourcentage_conservation()
public int quelle_carac_max(int i)
public int quelle_carac_min(int i)
public int quel_nb_pal()
public void changer_nombre_mutation_simple(int nbMutSimple)
public void changer_nombre_mutation_double(int nbMutDouble)
public void changer_poid_sequence(double score)
public void changer_nombre_erreur(int nberrreur)
public void changer_longueur(int longueur)
public void changer_longueur_Reelle(int longueur)
public void changer_conservation(int conservation)
public void changer_tauxMut(double nv)
public void changer_longMut(double nv)
public void changer_pertinence(double nv)
public void changer_type_critere(int nvcritere)
public void changer_indeci(boolean b)
public void changer_pourcentage_conservation(double nv)
public void changer_carac_max(int quelle_carac, int nv_carac)
public void changer_carac_min(int quelle_carac, int nv_carac)
public void changer_nb_pal(int nv)
public Palindrome1cible copie()
public static java.util.Vector traitement_Incompatibilite(Palindrome1cible[] tabPalCible, boolean plusieurs_resultats, double incertitude, int nb_prediction, int nb_prediction_max)
tabPalCible
- (Palindrome1cible[])plusieurs_resultats
- (boolean) much resultsincertitude
- (double) lack of precisionnb_prediction
- (int) number of predictionsnb_prediction_max
- (int) maximum number of predictions
ADN1cible.recherche_Palindrome(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
public static void incompatibilite_plusieurs_choix(java.util.Vector listeTabPal, int pos_tab, int i, int j, double incertitude, boolean plusieurs_resultats, int nb_prediction_max)
listeTabPal
- (Vector)pos_tab
- (int) position in tablei
- (int)j
- (int)incertitude
- (double)plusieurs_resultats
- (boolean)nb_prediction_max
- (int) maximum number of predictionstraitement_Incompatibilite(Palindrome1cible[], boolean, double, int, int)
public static Palindrome1cible[] incompatibilite_un_choix(Palindrome1cible[] tabPalCibleTrier, int i, int j)
tabPalCibleTrier
- (Palindrome1cible[])i
- (int)j
- (int)
traitement_Incompatibilite(Palindrome1cible[], boolean, double, int, int)
,
incompatibilite_plusieurs_choix(Vector, int, int, int, double, boolean, int)
private static Palindrome1cible[] trier_Palindrome_Comp(Palindrome1cible[] tabPal)
tabPal
- (Palindrome1cible[])
traitement_Incompatibilite(Palindrome1cible[], boolean, double, int, int)
private static boolean est_Compatible(Palindrome1cible pal1, Palindrome1cible pal2)
pal1
- (Palindrome1cible)pal2
- (Palindrome1cible)
incompatibilite_plusieurs_choix(Vector, int, int, int, double, boolean, int)
,
incompatibilite_un_choix(Palindrome1cible[], int, int)
public static Palindrome1cible[] fusion_Palindrome(Palindrome1cible[] tabPalCourant, Palindrome1cible[] tabPalPrincipal)
tabPalCourant
- (Palindrome1cible[])tabPalPrincipal
- (Palindrome1cible[])
ArbrePalindrome.recuperation(Vector, Palindrome1cible[], NoeudPalindrome)
,
ADN1cible.recherche_Palindrome(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
public Palindrome1cible[] trier_Palindrome_Fin(Palindrome1cible[] tabPal)
tabPal
- (Palindrome1cible[])
ADN1cible.diviser_regner(Palindrome1cible[], ADN1cible, ADN1test[], int, int, int, int, boolean, int)
,
ADN1cible.recherche_Pseudonoeud(Base[], ADN1test[], boolean, int, int)
public Palindrome1cible[] trier_Palindrome_Debut(Palindrome1cible[] tabPal)
tabPal
- (Palindrome1cible[])
ADN1cible.resultat_commun(Vector)
,
ArbrePalindrome.trier_structures()
public int[][] en_paire_de_bases(Palindrome1cible[] tabPal)
tabPal
- (Palindrome1cible[])
ADN1cible.comparaison_structure(ADN1cible, ADN1cible)
public java.util.Vector en_appariements(java.util.Vector appariements)
appariements
- (Vector) should be empty ? same is return with more inside...
Appariement.Appariement(int, int, double)
,
ADN1cible.calcul_score_structure(ADN1cible)
,
ADN1cible.calcul_score_structure(String, String)
,
ADN1cible.resultat_commun_paire_de_base(Vector)
public int score(Palindrome1cible pal2)
pal2
- (Palindrome1cible)
public void to_File(java.io.PrintWriter sortie)
to_File
in class Palindrome1
ADN1cible.to_File(String)
public void load_File(java.io.BufferedReader entree) throws java.lang.Exception
load_File
in class Palindrome1
entree
- (BufferedReader)
java.lang.Exception
- eADN1cible.load_File(BufferedReader)
,
Interface12.setInterface(Profil, String, Palindrome1cible, int)
public int rechercher(java.util.Vector tabPal)
tabPal
- (Vector)
ADN1cible.resultat_commun(Vector)
public int rechercher_approx(java.util.Vector tabPal)
tabPal
- (Vector)
ADN1cible.resultat_commun(Vector)
private boolean egaux(Palindrome1cible p)
p
- (Palindrome1cible)
rechercher(Vector)
public boolean inclu_dans(Palindrome1cible p)
p
- (Palindrome1cible)
ADN1cible.palindromes_communs(Palindrome1cible[], Palindrome1cible[], boolean)
,
rechercher_approx(Vector)
,
incompatibilite_plusieurs_choix(Vector, int, int, int, double, boolean, int)
,
incompatibilite_un_choix(Palindrome1cible[], int, int)
public boolean chevauchant(Palindrome1cible p)
p
- (Palindrome1cible)
ADN1cible.resultat_commun(Vector)
public static Palindrome1cible[] vec_to_tab(java.util.Vector vec)
vec
- (Vector)
ADN1cible.resultat_commun(Vector)
public java.lang.String toString()
toString
in class Palindrome1
ADN1cible.afficher_Caracteristique()
,
toString()
public java.lang.String toString_web()
toString_web
in class Palindrome1
ADN1cible.afficher_Caracteristique_Web()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |