|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorigincomment.ADN1
origincomment.ADN1cible
public class ADN1cible
"Tous les pseudonoeuds d'une sous sequence sont recherches"
"All pseudoknots of a sequence are searched. "
This class for desaligned / unaligned sequences : methods works like that...
Most part of algorithms for P-DCFold in this class. Some french comments in procedures
they have been written by Stefan Engelen and letted in in quote and translated...
calcul_Resultat(ADN1test[], int, boolean, boolean)
,
diviser_regner(Palindrome1cible[], ADN1cible, ADN1test[], int, int, int, int, boolean, int)
,
recherche_Palindrome(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
,
recherche_Pseudonoeud(Base[], ADN1test[], boolean, int, int)
,
recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
resultat_commun(Vector)
,
traitement_Zone_Variable(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
,
verifier_Conservation(Palindrome1cible, Palindrome1test, double, double, int, ADN1test[])
,
verifier_Conservation_Commune(Palindrome1cible, Palindrome1test, double, double, int, ADN1test[])
,
verifier_Conservation_Commune(Palindrome1cible, Palindrome1test, double, double, int, ADN1test[])
,
ADN1test
,
Palindrome1cible
,
Matrice_ALN
,
Base
Field Summary | |
---|---|
static int |
ALIGNEMENTHELICE
"Global attributes of work" Helix alignment is 3. |
static int |
ARN_MESSAGER
"Global attributes of work" Messenger RNA is 2. |
static int |
ARN_STRUCTURAL
"Global attributes of work" Structural RNA is 1. |
private boolean |
chercher_pk
"Global attribute with signification. |
private int |
decalage
"Global attribute with signification. |
private double |
incertitude
"Global attribute with signification. |
static int |
LONG_MUT
"Global attributes of work" Mutation length is 2. |
private int |
longueur
"Global attribute with signification. |
private int |
nb_prediction_max
"Global attribute with signification. |
static int |
PROFILHELICE
"Global attributes of work" Helix profile is 2. |
private int |
pseudonoeud
"Global attributes of work" Current complexity of searching pseudoknots. |
private Base[] |
sequence
"Global attribute with signification. |
static int |
STRUCTURECOMMUNE
"Global attributes of work" Common structure is 1. |
private ADN1test[] |
tableauInitial
"Global attribute with signification. |
private ArbrePalindrome |
tableauPalindrome
"Global attribute with signification. |
private int |
taille_boucle_min
"Global attribute with signification. |
private int |
taille_pal_min
"Global attribute with signification. |
static int |
TAUX_MUT
"Global attributes of work" Mutation rate is 1. |
private boolean |
trouvePseudonoeud
"Global attributes of work" Have pseudoknots been found in current step... |
private int |
typeARN
"Global attribute with signification. |
private int |
typeCritere
"Global attribute with signification. |
private int |
typeRecherche
"Global attribute with signification. |
Fields inherited from class origincomment.ADN1 |
---|
nom |
Constructor Summary | |
---|---|
ADN1cible()
Default constructor : nothing happend. |
|
ADN1cible(java.lang.String nomFichier,
java.lang.String sequence)
Constructor with name and aligned sequence... |
Method Summary | |
---|---|
java.lang.String |
afficher_Caracteristique_Web()
Some changes to this procedure to make results appears for web / HTML. |
java.lang.String |
afficher_Caracteristique()
SOME SHOW FOR VIEW "This method for show on a target sequence of DNA" |
java.lang.String |
afficher_Sequences(Palindrome1cible pal,
ADN1test[] tabSeq)
RESULT TREAMENT "This method show palindromes of tests sequences correponding to a target sequence palindrome et give informations about relevance of this palindrome" |
static java.lang.String |
afficher(Palindrome1cible[] tabPal)
SOME SHOW FOR VIEW "This method to show the palindromes' tab" |
void |
calcul_Resultat(ADN1test[] tabAdn,
int typeRecherche,
boolean plusieurs_resultats,
boolean chercher_pk)
MAIN COMPUTING RESULTS "This method to launch search and compute all wanted results" |
double[] |
calcul_score_structure(ADN1cible adn_ref)
RESULT TREAMENT "Compute the score of structure face to a reference (two DNA in input)" |
static double[] |
calcul_score_structure(java.lang.String entree_reference,
java.lang.String entree_structure)
RESULT TREAMENT "Compute the score of a structure face a reference (two structures files in input)" |
static double[] |
calcul_score_structure(java.util.Vector reference,
java.util.Vector structure)
RESULT TREAMENT "Compute the score of a strcuture face to a reference (two pairwise vector in input)" |
int |
calcul_Taille(Palindrome1cible pal)
COMPATIBLE PALINDROME SEARCH "This method to compute internal sequence length at step i |
void |
change_chercher_pk(boolean nv)
|
void |
change_decalage(int nvdec)
|
void |
change_incertitude(double nvincertitude)
|
void |
change_nb_prediction_max(int nbnv)
|
void |
change_palindromes(Palindrome1cible[] tabPal)
To set the table of palindrome and change the tree of algorithms. |
void |
change_taille_boucle_min(int nvmin)
|
void |
change_taille_pal_min(int nvmin)
|
void |
change_type_arn(int nvtype)
|
void |
change_type_critere(int nvcritere)
|
static Palindrome1cible[][] |
comparaison_palindrome(Palindrome1cible[] tabPal1,
Palindrome1cible[] tabPal2)
RESULT TREAMENT "Methods to compare recorded results in files. |
java.lang.String |
comparaison_Resultat(java.io.BufferedReader entree1,
java.io.BufferedReader entree2)
RESULT TREAMENT "Methods to compare recorded results in files. |
int |
comparaison_structure(ADN1cible adn1,
ADN1cible adn2)
Deprecated. [never used] |
static java.lang.String |
comparaison(ADN1cible adn1,
ADN1cible adn2)
RESULT TREAMENT "Methods to compare recorded results in files. |
ADN1cible |
copier()
To clone the current instance of ADN1cible. |
private static java.lang.String |
decoupeString_Web(java.lang.String chaineDecoupe)
This method to cut a String by 80 characters length substring. |
private static java.lang.String |
decoupeString(java.lang.String chaineDecoupe)
This method to cut a String by 80 characters length substring. |
void |
diviser_regner(Palindrome1cible[] tabPal,
ADN1cible adn,
ADN1test[] tableauSequence,
int debut,
int fin,
int erreur,
int etape,
boolean plusieurs_resultats,
int nb_prediction)
COMPATIBLE PALINDROME SEARCH Divide and Conquer procedure... |
boolean |
est_Une_Base_Test(char base)
COMPATIBLE PALINDROME SEARCH "This method test if a char is a base" |
void |
initialiser()
Initialization of algorithm. |
Palindrome1cible[] |
la_structure(int pos)
To get a specific structure. |
Palindrome1cible |
le_palindrome(int pos_struct,
int pos_pal)
To get a specific palindrome in a specific structure. |
ADN1test[] |
les_sequences_tests()
To get test sequences. |
java.util.Vector |
les_structures()
To get structures from algorithm tree. |
void |
load_File(java.io.BufferedReader entree)
RESULT TREAMENT "This method create an object from recorded data in a file" |
void |
mettre_etoile(int pos_struct)
PSEUDOKNOTS SEARCH "This method to put stars (*) in found palindromes in aim to find pseudoknots)" |
static Palindrome1cible[][] |
palindromes_communs(Palindrome1cible[] tabPal1,
Palindrome1cible[] tabPal2,
boolean struc_com)
RESULT TREAMENT "Previous method variation [comparaison_palindrome] to find common palindromes between two predictions. |
java.lang.String |
pourcentage_base()
Deprecated. [never used] |
void |
pourcentage_Mutation(ADN1test[] adntest,
int pos_struct,
boolean bool)
Deprecated. [never used] |
ArbrePalindrome |
quel_tableau_palindrome()
To get the algorithm tree. |
int |
quelle_longueur()
To get the length of the sequence. |
Base[] |
quelle_sequence()
To get the sequence tab. |
int |
recherche_commune()
Common search. |
private void |
recherche_Palindrome(ADN1cible adn,
int debut,
int fin,
int taille,
ADN1test[] tableauSequence,
int erreur,
int etape,
boolean plusieurs_resultats,
int nb_prediction)
COMPATIBLE PALINDROME SEARCH "Methode qui recherche des palindromes dans une sequence d'ADN" This method search palindromes in DNA sequence. |
Palindrome1cible[] |
recherche_Point_Ancrage(ADN1cible adn,
int debut,
int fin,
int taille,
double lmin,
ADN1test[] tableauSequence,
int erreur)
COMPATIBLE PALINDROME SEARCH "R=This method search anchor points at step i from palindrome search (on the subsequence i on starting sequence). |
private void |
recherche_Pseudonoeud(Base[] sequencepseudonoeud,
ADN1test[] tabAdn,
boolean plusieurs_resultats,
int pos_struct,
int nb_prediction)
PSEUDOKNOTS SEARCH "This method for pseudoknots search : we launch search on each internal sequence of palindromes (form more external to more internal) as selection criteria decrease" |
void |
resultat_commun_paire_de_base(java.util.Vector vec)
Deprecated. [never used] |
void |
resultat_commun(java.util.Vector vec)
RESULT TREAMENT "This method compute a common result from vector of tab of palindromes" |
private static int |
score(char x,
char y)
COMPATIBLE PALINDROME SEARCH Getting a score from two (2) bases. |
static ADN1 |
sequenceCible(java.lang.String sequenceCible,
boolean cible)
SOME SHOW FOR VIEW "To get target sequence" |
java.lang.String |
to_File(java.lang.String fichier)
RESULT TREAMENT "This method write results in a file" |
java.lang.String |
toString(int debut,
int fin)
SOME SHOW FOR VIEW "To visualize considered sequence [current instance]" |
private void |
traitement_Zone_Variable(ADN1cible adn,
int debut,
int fin,
int taille,
ADN1test[] tableauSequence,
int erreur,
int etape,
boolean plusieurs_resultats,
int nb_prediction)
COMPATIBLE PALINDROME SEARCH "This method to search anchors points in a highly varible part of sequence" |
Base |
une_base(int position)
To get a Base at a specific position. |
Base[] |
une_sous_sequence(int debut,
int fin)
To get a subsequence of sequence. |
boolean |
verifier_Conservation_Alignement(Palindrome1cible palCourantReel,
Palindrome1test palCourantFaux,
double lmin,
ADN1test[] tabSeq)
COMPATIBLE PALINDROME SEARCH "this method compare palindromes found on each step of palindrome search to know if there are palindromes at the same place but they can be different (it is in that case they are relevant)This method compute in the same time the number of singles and compensatory (double) mutations. |
boolean |
verifier_Conservation_Commune(Palindrome1cible palCourantReel,
Palindrome1test palCourantFaux,
double decalage,
double lmin,
int erreur,
ADN1test[] tabSeq)
COMPATIBLE PALINDROME SEARCH "this method compare palindromes found on each step of palindrome search to know if there are palindromes at the same place but they can be different (it is in that case they are relevant)This method compute in the same time the number of singles and compensatory (double) mutations. |
boolean |
verifier_Conservation(Palindrome1cible palCourantReel,
Palindrome1test palCourantFaux,
double decalage,
double lmin,
int erreur,
ADN1test[] tabSeq)
COMPATIBLE PALINDROME SEARCH "this method compare palindromes found on each step of palindrome search to know if there are palindromes at the same place but they can be different (it is in that case they are relevant)This method compute in the same time the number of singles and compensatory (double) mutations. |
Methods inherited from class origincomment.ADN1 |
---|
change_nom, est_Une_Base, match, quel_nom, to_File |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
private int longueur
private Base[] sequence
Base
,
quelle_sequence()
private ArbrePalindrome tableauPalindrome
ArbrePalindrome
,
quel_tableau_palindrome()
private int typeRecherche
ALIGNEMENTHELICE
,
PROFILHELICE
,
STRUCTURECOMMUNE
,
calcul_Resultat(ADN1test[], int, boolean, boolean)
private boolean chercher_pk
calcul_Resultat(ADN1test[], int, boolean, boolean)
private int typeCritere
TAUX_MUT
,
LONG_MUT
,
calcul_Resultat(ADN1test[], int, boolean, boolean)
private int typeARN
ARN_STRUCTURAL
,
ARN_MESSAGER
,
calcul_Resultat(ADN1test[], int, boolean, boolean)
private double incertitude
calcul_Resultat(ADN1test[], int, boolean, boolean)
private int decalage
calcul_Resultat(ADN1test[], int, boolean, boolean)
private int taille_boucle_min
calcul_Resultat(ADN1test[], int, boolean, boolean)
private int taille_pal_min
calcul_Resultat(ADN1test[], int, boolean, boolean)
private int nb_prediction_max
calcul_Resultat(ADN1test[], int, boolean, boolean)
private ADN1test[] tableauInitial
les_sequences_tests()
private int pseudonoeud
private boolean trouvePseudonoeud
public static final int ARN_STRUCTURAL
public static final int ARN_MESSAGER
public static final int TAUX_MUT
public static final int LONG_MUT
public static final int STRUCTURECOMMUNE
public static final int PROFILHELICE
public static final int ALIGNEMENTHELICE
Constructor Detail |
---|
public ADN1cible()
AloneProcessus.cible
,
calcul_score_structure(String, String)
,
comparaison_Resultat(BufferedReader, BufferedReader)
,
copier()
,
TestAln.main(String[])
,
ADN1test.resultat_Optimal(ADN1cible, ADN1test, ADN1test[], BufferedReader, int, int, int, boolean)
,
Interface12.setInterface(Profil, String, Palindrome1cible, int)
public ADN1cible(java.lang.String nomFichier, java.lang.String sequence)
nomFichier
- (String) name of the filesequence
- (String) aligned sequenceADN1.est_Une_Base(char)
,
est_Une_Base_Test(char)
Method Detail |
---|
public int quelle_longueur()
longueur
public Base[] quelle_sequence()
Base
public Base une_base(int position)
position
- (int)
public Base[] une_sous_sequence(int debut, int fin)
debut
- (int) beginfin
- (int) end
public ArbrePalindrome quel_tableau_palindrome()
tableauPalindrome
public java.util.Vector les_structures()
ArbrePalindrome.quellesStructures()
,
afficher_Caracteristique()
,
calcul_Resultat(ADN1test[], int, boolean, boolean)
,
calcul_score_structure(ADN1cible)
,
comparaison_structure(ADN1cible, ADN1cible)
,
comparaison(ADN1cible, ADN1cible)
,
ADN1.to_File(PrintWriter)
public Palindrome1cible[] la_structure(int pos)
pos
- (int)
public Palindrome1cible le_palindrome(int pos_struct, int pos_pal)
pos_struct
- (int) position of the structure.pos_pal
- (int) position of palindrome in structure.
ArbrePalindrome.quelPalindrome(int, int)
public ADN1test[] les_sequences_tests()
tableauInitial
public int recherche_commune()
typeRecherche
public void change_palindromes(Palindrome1cible[] tabPal)
tabPal
- (Palindrome1cible[])Interface12.setInterface(Profil, String, Palindrome1cible, int)
,
ArbrePalindrome.ArbrePalindrome(NoeudPalindrome)
,
NoeudPalindrome.NoeudPalindrome(Palindrome1cible[])
public void change_decalage(int nvdec)
public void change_taille_boucle_min(int nvmin)
public void change_taille_pal_min(int nvmin)
public void change_type_critere(int nvcritere)
public void change_type_arn(int nvtype)
public void change_incertitude(double nvincertitude)
public void change_nb_prediction_max(int nbnv)
public void change_chercher_pk(boolean nv)
public void initialiser()
tableauPalindrome
,
pseudonoeud
,
tableauInitial
public ADN1cible copier()
Interface12.setInterface(Profil, String, Palindrome1cible, int)
private void recherche_Palindrome(ADN1cible adn, int debut, int fin, int taille, ADN1test[] tableauSequence, int erreur, int etape, boolean plusieurs_resultats, int nb_prediction)
adn
- (ADN1cible) target sequencedebut
- (int) begin analysisfin
- (int) end of analysistaille
- (int) lengt of targettableauSequence
- (ADN1test[]) homologuous sequenceserreur
- (int)etape
- (int) stepplusieurs_resultats
- (boolean) much resultsnb_prediction
- (int) number of predictionsdiviser_regner(Palindrome1cible[], ADN1cible, ADN1test[], int, int, int, int, boolean, int)
,
recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
traitement_Zone_Variable(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
public void diviser_regner(Palindrome1cible[] tabPal, ADN1cible adn, ADN1test[] tableauSequence, int debut, int fin, int erreur, int etape, boolean plusieurs_resultats, int nb_prediction)
tabPal
- (Palindrome1cible[])adn
- (ADN1cible) target sequencetableauSequence
- (ADN1test[]) homologuousdebut
- (int) beginfin
- (int) enderreur
- (int)etape
- (int) stepplusieurs_resultats
- (boolean)nb_prediction
- (int)recherche_Palindrome(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
,
Palindrome1cible.trier_Palindrome_Fin(Palindrome1cible[])
,
calcul_Taille(Palindrome1cible)
public Palindrome1cible[] recherche_Point_Ancrage(ADN1cible adn, int debut, int fin, int taille, double lmin, ADN1test[] tableauSequence, int erreur)
adn
- (ADN1cible) targetdebut
- (int) beginfin
- (int) endtaille
- (int) lengthlmin
- (int)tableauSequence
- (ADN1test[])erreur
- (int)
private static int score(char x, char y)
x
- (char)y
- (char)
recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
Matrice_ALN.score(char, char)
private void traitement_Zone_Variable(ADN1cible adn, int debut, int fin, int taille, ADN1test[] tableauSequence, int erreur, int etape, boolean plusieurs_resultats, int nb_prediction)
adn
- (ADN1cible)debut
- (int) beginfin
- (int) endtaille
- (int) lengthtableauSequence
- (ADN1test)erreur
- (int)etape
- (int) stepplusieurs_resultats
- (boolean)nb_prediction
- (int)recherche_Palindrome(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
public boolean verifier_Conservation_Commune(Palindrome1cible palCourantReel, Palindrome1test palCourantFaux, double decalage, double lmin, int erreur, ADN1test[] tabSeq)
palCourantReel
- (Palindrome1cible)palCourantFaux
- (Palindrome1test)decalage
- (double)lmin
- (double)erreur
- (int)tabSeq
- (ADN1test) homologuous
recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
Interface5.setInterface(ADN1cible, ADN1test[], int, int, int, int, int)
public boolean verifier_Conservation(Palindrome1cible palCourantReel, Palindrome1test palCourantFaux, double decalage, double lmin, int erreur, ADN1test[] tabSeq)
palCourantReel
- (Palindrome1cible)palCourantFaux
- (Palindrome1test)decalage
- (double)lmin
- (double)erreur
- (int)tabSeq
- (ADN1test[])
Interface5.setInterface(ADN1cible, ADN1test[], int, int, int, int, int)
public boolean verifier_Conservation_Alignement(Palindrome1cible palCourantReel, Palindrome1test palCourantFaux, double lmin, ADN1test[] tabSeq)
palCourantReel
- (Palindrome1cible)palCourantFaux
- (Palindrome1test)lmin
- (double)tabSeq
- (ADN1test[])
recherche_Point_Ancrage(ADN1cible, int, int, int, double, ADN1test[], int)
,
Interface5.setInterface(ADN1cible, ADN1test[], int, int, int, int, int)
,
TestAln.main(String[])
,
Matrice_ALN
public int calcul_Taille(Palindrome1cible pal)
pal
- (Palinrome1cible)
diviser_regner(Palindrome1cible[], ADN1cible, ADN1test[], int, int, int, int, boolean, int)
,
recherche_Pseudonoeud(Base[], ADN1test[], boolean, int, int)
public boolean est_Une_Base_Test(char base)
base
- (char)
ADN1cible(String, String)
,
Profil.remplir(Palindrome1cible[], int)
private void recherche_Pseudonoeud(Base[] sequencepseudonoeud, ADN1test[] tabAdn, boolean plusieurs_resultats, int pos_struct, int nb_prediction)
sequencepseudonoeud
- (Base[])tabAdn
- (ADN1test[])plusieurs_resultats
- (boolean)pos_struct
- (int)nb_prediction
- (int)calcul_Resultat(ADN1test[], int, boolean, boolean)
public void mettre_etoile(int pos_struct)
pos_struct
- (int)recherche_Pseudonoeud(Base[], ADN1test[], boolean, int, int)
,
calcul_Resultat(ADN1test[], int, boolean, boolean)
,
Interface5.setInterface(ADN1cible, ADN1test[], int, int, int, int, int)
public void calcul_Resultat(ADN1test[] tabAdn, int typeRecherche, boolean plusieurs_resultats, boolean chercher_pk) throws java.lang.Exception
tabAdn
- (ADN1test[]) target sequence at 0 then tests sequences...typeRecherche
- (int) 3 (very good default option) ALIGNEMENTHELICE
plusieurs_resultats
- (boolean) (true for maybe some structures)chercher_pk
- (boolean) true (default is better to search and find pseudoKnots)
java.lang.Exception
- etypeRecherche
,
typeCritere
,
chercher_pk
,
nb_prediction_max
,
incertitude
,
decalage
,
typeARN
,
taille_boucle_min
,
taille_pal_min
,
ProcessusOrigin.computing(Vector, ADN1cible, boolean, boolean)
,
OriginAlgorithmsStefan.computing(Vector, ADN1cible, boolean, boolean)
,
ADN1test.meilleur_combinaison_sequence(ADN1cible, ADN1cible, ADN1test, ADN1test[], int[], int, int, int, int, int, Resultat, boolean)
public java.lang.String to_File(java.lang.String fichier)
fichier
- (String)
ProcessusOrigin.computing(Vector, ADN1cible, boolean, boolean)
,
OriginAlgorithmsStefan.computing(Vector, ADN1cible, boolean, boolean)
public void load_File(java.io.BufferedReader entree) throws java.lang.Exception
load_File
in class ADN1
entree
- (BufferedReader)
java.lang.Exception
- ecalcul_score_structure(String, String)
,
comparaison_Resultat(BufferedReader, BufferedReader)
,
ADN1test.resultat_Optimal(ADN1cible, ADN1test, ADN1test[], BufferedReader, int, int, int, boolean)
public java.lang.String comparaison_Resultat(java.io.BufferedReader entree1, java.io.BufferedReader entree2) throws java.lang.Exception
entree1
- (BufferedReader)entree2
- (BufferedReader)
java.lang.Exception
- ecomparaison(ADN1cible, ADN1cible)
,
comparaison_palindrome(Palindrome1cible[], Palindrome1cible[])
,
comparaison_Resultat(BufferedReader, BufferedReader)
public static java.lang.String comparaison(ADN1cible adn1, ADN1cible adn2)
adn1
- (ADN1cible)adn2
- (ADN1cible)
comparaison(ADN1cible, ADN1cible)
,
comparaison_palindrome(Palindrome1cible[], Palindrome1cible[])
,
comparaison_Resultat(BufferedReader, BufferedReader)
public static Palindrome1cible[][] comparaison_palindrome(Palindrome1cible[] tabPal1, Palindrome1cible[] tabPal2)
tabPal1
- (Palindrome1cible[])tabPal2
- (Palindrome1cible[])
comparaison(ADN1cible, ADN1cible)
,
comparaison_palindrome(Palindrome1cible[], Palindrome1cible[])
,
comparaison_Resultat(BufferedReader, BufferedReader)
,
palindromes_communs(Palindrome1cible[], Palindrome1cible[], boolean)
public static Palindrome1cible[][] palindromes_communs(Palindrome1cible[] tabPal1, Palindrome1cible[] tabPal2, boolean struc_com)
tabPal1
- (Palindrome1cible[])tabPal2
- (Palindrome1cible[])struc_com
- (boolean)
comparaison_palindrome(Palindrome1cible[], Palindrome1cible[])
,
resultat_commun(Vector)
public static double[] calcul_score_structure(java.lang.String entree_reference, java.lang.String entree_structure) throws java.lang.Exception
entree_reference
- (String)entree_structure
- (String)
java.lang.Exception
- eAppariement.en_paire_de_bases(BufferedReader)
,
Interface9.setInterface(ADN1cible, String, String, double)
,
calcul_score_structure(ADN1cible)
,
calcul_score_structure(String, String)
,
calcul_score_structure(Vector, Vector)
public double[] calcul_score_structure(ADN1cible adn_ref)
adn_ref
- (ADN1cible)
calcul_score_structure(ADN1cible)
,
calcul_score_structure(String, String)
,
calcul_score_structure(Vector, Vector)
public static double[] calcul_score_structure(java.util.Vector reference, java.util.Vector structure)
reference
- (Vector)structure
- (Vector)
calcul_score_structure(ADN1cible)
,
calcul_score_structure(String, String)
,
calcul_score_structure(Vector, Vector)
public int comparaison_structure(ADN1cible adn1, ADN1cible adn2)
adn1
- (ADN1cible)adn2
- (ADN1cible)
public void resultat_commun(java.util.Vector vec)
vec
- (Vector)ProcessusOrigin.computing(Vector, ADN1cible, boolean, boolean)
,
OriginAlgorithmsStefan.computing(Vector, ADN1cible, boolean, boolean)
public void resultat_commun_paire_de_base(java.util.Vector vec)
vec
- (Vector)public void pourcentage_Mutation(ADN1test[] adntest, int pos_struct, boolean bool)
adntest
- (ADN1test[])pos_struct
- (int)bool
- (boolean)public java.lang.String afficher_Sequences(Palindrome1cible pal, ADN1test[] tabSeq)
pal
- (Palindrome1cible)tabSeq
- (ADN1text[])
Interface5.setInterface(ADN1cible, ADN1test[], int, int, int, int, int)
public java.lang.String afficher_Caracteristique()
afficher_Caracteristique
in class ADN1
Interface3.setInterface(ADN1cible, Vector)
public java.lang.String afficher_Caracteristique_Web()
afficher_Caracteristique_Web
in class ADN1
Palindrome1cible.toString_web()
private static java.lang.String decoupeString(java.lang.String chaineDecoupe)
chaineDecoupe
- (String)
private static java.lang.String decoupeString_Web(java.lang.String chaineDecoupe)
chaineDecoupe
- (String)
public static java.lang.String afficher(Palindrome1cible[] tabPal)
tabPal
- (Palindrome1cible[])
comparaison(ADN1cible, ADN1cible)
,
Interface7.setInterface(ADN1cible, ADN1test[], int, int, int)
public java.lang.String toString(int debut, int fin)
debut
- (int) beginfin
- (int) end
afficher_Caracteristique()
,
Interface12.setInterface(Profil, String, Palindrome1cible, int)
public static ADN1 sequenceCible(java.lang.String sequenceCible, boolean cible)
sequenceCible
- cible
-
ProcessusOrigin.computing(Vector, ADN1cible, boolean, boolean)
,
OriginAlgorithmsStefan.computing(Vector, ADN1cible, boolean, boolean)
public java.lang.String pourcentage_base()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |